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

Output: 15

hide comments
P_Quantum: 2013-08-02 10:19:28

nice one...!!

Abhinav Aggarwal: 2013-06-11 11:59:42

Nice question! :)

Lakshay Singhal: 2013-04-16 18:51:28

getting NZEC....running well on ideone and other compiler

Ivan Nikulin: 2013-04-01 09:46:13

I somehow managed to assume that all the numbers are different (: Therefore, HINT: numbers might NOT be DISTINCT!

Pranshul Agarwal: 2013-06-18 14:56:49

Nice problem. Learnt a lot from this.. :)

Surya kiran: 2012-12-17 18:35:31

ABHISHEK +1 for you

Abhishek: 2012-12-17 12:49:30

All numbers will be between 0 and 10^6.??
input cases contain 0 also. caused 2 TLEs :(

(Tjandra Satria Gunawan)(曾毅昆): 2012-09-27 04:48:22

finally, got AC in 0.26sec. :-)
use long long, if not will getting WA.

Last edit: 2012-09-27 09:34:53
Monkey D. Luffy : 2012-08-26 19:35:40

@stefan segmentation fault
for more info http://en.wikipedia.org/wiki/SIGSEGV

Last edit: 2012-08-26 19:36:43
Sardar Khan: 2012-08-09 07:43:11

Nice problem :)

Added by:dce coders
Time limit:1.259s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:Own Problem