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
v_ns: 2017-04-01 08:06:30

Think of using merge sort.

hasan356: 2017-03-22 13:12:57

Beaware of zero !!

shahzada: 2017-03-21 19:44:04

easy one ;)

Rakend Chauhan: 2016-11-24 23:38:04

dont you think the question is misleading
" All numbers will be between 0 and 10^6 "
it should be between and equal to 0 and 10^6.

Last edit: 2016-11-24 23:40:51
blackjack123: 2016-10-19 00:15:27

9 9 10 10 10 9 9 10 10 10
output 162

Gaurav Dahima: 2016-08-18 09:05:29

my solution passed every possible test cases, still getting WA, Please have a look, solution id is 17528935

Edit: finally AC. Overflow, due to (long long)(L[i]*(n2-j)) instead of (long long)L[i]*(n2-j).

Last edit: 2016-08-18 12:59:44
satyroxx1397: 2016-08-03 16:02:04

use LONG LONG INT in cpp

anuj0503: 2016-07-05 13:33:25

BITS !! AC !!

truetubelight: 2016-04-25 07:44:50

Why does the tag say binary search if its using merge sort or BIT?

gautam: 2016-03-14 13:47:06

plz help i am getting WA ...need more testcases:(

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