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
Why does the tag say binary search if its using merge sort or BIT?
plz help i am getting WA ...need more testcases:(
BIT cannot pass in java :(
just a minor variation of INVCNT problem... got AC in 0.10s without BIT... just used merge sort (along with long long int) :) (took me 1 hour)Last edit: 2016-01-13 19:22:25
easy if know inversion count method
use long long cost me 3 WA....!!!!
BIT and fast i/o 0.05! :)
This is one great problem....It has so many vivid approaches to solve other than merge-sort..
free mind ;):
use long long for calculating sum!