KQUERY - K-query

Given a sequence of n numbers a1, a2, ..., an and a number of k- queries. A k-query is a triple (i, j, k) (1 ≤ i ≤ j ≤ n). For each k-query (i, j, k), you have to return the number of elements greater than k in the subsequence ai, ai+1, ..., aj.

Input

  • Line 1: n (1 ≤ n ≤ 30000).
  • Line 2: n numbers a1, a2 ... an (1 ≤ ai ≤ 109).
  • Line 3: q (1 ≤ q ≤ 200000), the number of k- queries.
  • In the next q lines, each line contains 3 numbers i, j, k representing a k-query (1 ≤ i ≤ j ≤ n, 1 ≤ k ≤ 109).

Output

  • For each k-query (i, j, k), print the number of elements greater than k in the subsequence ai, ai+1 ... aj in a single line.

Example

Input
5
5 1 2 3 4
3
2 4 1
4 4 4
1 5 2 

Output
2
0
3 


Added by:Jimmy
Date:2008-10-26
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:Gomoku

hide comments
2022-02-22 22:06:25
merge sort tree + binary search = (:
2022-02-17 01:39:27
sqrt decomposition + binary search => AC
2022-02-07 08:42:10
Solved with BIT + offline queries
2022-01-13 13:29:46
Use Marge Sort Tree + Binary Search
2022-01-13 07:15:05
Use Mo's Algorithm with time complexity O(n\sqrt{n}) and AC !!!
2021-11-08 19:12:32
Getting WA. Any clue?
2021-08-25 14:16:42
used merge sort tree + bin search
2021-08-18 07:52:18
codencode op
Used segment +merge sort in JAVA
2021-07-21 10:51:25
@erne1309 interesting approach. Can you provide details?
2021-07-11 06:10:09
ft+sort :)

Last edit: 2021-07-11 06:11:31
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.