Can anyonre give me a hint how to solve this problem here!
Assuming that you are familiar with segment tree
You can solve this problem by building a segment tree, with a sorted sub-array in every vertex and then divide [l, r] into sub-segments, and do binary search on sub-segments.
You can solve this problem by using Offline solution method and by creating Balance Binary Search Tree incrementally… First iterate over all queries and store for each index what is query on that… While creating Balanced BST you can find out number of smaller elements till now in log(N) using Binary Search tree that we have made till that point, and store answer for that pair(i,k) in some dict ansThatWeFound. Now iterate through query again, for ans(i,j,k) = ansThatWeFound(j,k) - ansThatWeFound(i-1,k). Hope this was clear enough and was providing enough info to approach this question now… I you have some doubt then you can ask that in comments…
Using sorted sub-array in every vertex will take n^2 log(n) time, no?? If I am getting correctly what you are saying…
\log(n)^2 for each query
no… while creating tree itself… Can you post some pseudo code here…??
Did not know about this… thanks…
can i do this with fenwick trees ??
amm creating the tree with sorted subarray will cost me N* log(n)* log(logn)
and for each query it will cost log(n)*log(log(n))
An approach for this problem is explained here: http://codeforces.com/blog/entry/10183?#comment-156355.