KQUERY - K-query

no tags 

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 

hide comments
Abhishek Jaisingh: 2016-12-17 23:28:06

segtree + offline = AC!! <3

Ravi kumar: 2016-10-25 21:17:45

persistence segment tree with fast io accepted :)

akchoubey: 2016-10-07 16:23:53

I applied segment tree at first and got TLE
then applied fast I/O and I now get segmentation fault. What might be the problem??
Please help

V Manikantan: 2016-10-05 15:43:01

Persistent segment trees works comfortably

blackjack123: 2016-10-03 22:42:02

my 100 th

RISHAV KUMAR: 2016-10-01 00:31:40

Has anyone done it in java using BIT..? I'm getting TLE, while the same code in c++ is getting passed. such a pain..

Last edit: 2016-10-01 00:31:57
divide_by_1: 2016-08-29 06:32:59

Did some one got AC with sqrt decomposition ?

buttman: 2016-07-18 16:19:16

time limit should be increased a bit.

askerov: 2016-07-07 17:19:18

I wrote Segment Tree, but it doesn't work. I have got TLE. What is Time limit: 0.184s? only build gets 0.2s

proficient: 2016-05-25 16:49:56

Anyone got AC with O( Q log^2 (N) ) ? I get TLE even with fast IO, typedef and inline functions.


Added by:Duc
Date:2008-10-26
Time limit:0.184s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS NODEJS PERL 6 VB.net
Resource:© VNOI