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
I'm getting wrong ans... plz give me d special test case..
After one TLE accepted B|
Can someone please explain the given test-case? I am stuck there itself ..
Nice prblm :)
Is it solvable in O(n) ?
Beware of overflows. To avoid that, use long long throughout your code :)
Handle the overflows during multiplication. Lots of WAs because of that
My 50th :D
remember "sum of all the numbers previously seen on the stairs which are smaller than the present number" and not smaller or equal.Equal costed me a WA. But still it is a nice one!
A lot of server instability. Using unsigned long long is faster than long long. Can anyone explain please? :)