DCEPC206 - Its a Murder!
Once detective Saikat was solving a murder case. While going to the crime scene he took the stairs and saw that a number is written on every stair. He found it suspicious and decides to remember all the numbers that he has seen till now. While remembering the numbers he found that he can find some pattern in those numbers. So he decides that for each number on the stairs he will note down the sum of all the numbers previously seen on the stairs which are smaller than the present number. Calculate the sum of all the numbers written on his notes diary.
First line gives T, number of test cases.
2T lines follow.
First line gives you the number of stairs N
Next line gives you N numbers written on the stairs.
For each test case output one line giving the final sum for each test case.
All numbers will be between 0 and 10^6.
1 5 3 6 4
Same as "count inversion problem"
Coordinate Compression + BIT
If you use BIT then use coordinate compression, otherwise you'll get TLE.
AC in one go :)
Merge sort - 0.07s
hey @k0walsk1 may be when you are decreasing the value of i you are doing it till i >= 0 ;
Can someone explain why using i & (-i) for the bit functions gives TLE??
make sure that question says "strictly less than" not "less than qual to"...................:)
Simple implementation of FENWICK Trees!!Beware of 0!!!Try INVCNT after this one :)
use long long everywhere to prevent overflows. Cost me 2 WA's