hello sir/mam.
recently i learnt binary indexed tree.
i did two probelms now...
but i got stuck for the problem below.....
http://www.spoj.com/problems/INVCNT/
could any one give clear explaination of doing this problem....
i would be very thankful to you...
thanks in advance...
Here is the solution: Inversions With BIT