Submit | All submissions | Best solutions | Back to list |
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 until 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.
Input
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.
Output
For each test case output one line giving the final sum for each test case.
Constraints
T ≤ 10
1 ≤ N ≤ 105
All numbers will be between 0 and 106.
Example
Input: 1
5
1 5 3 6 4
Output: 15
Added by: | dce coders |
Date: | 2012-02-26 |
Time limit: | 1.259s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
Resource: | Own Problem |
hide comments
|
|||||||||||
2024-03-02 07:13:38
AC in one go, with fenwick tree |
|||||||||||
2023-06-28 05:38:50
I am getting WA using mergeSort. https://www.spoj.com/submit/DCEPC206/id=31543232. Pls tell me What is the error |
|||||||||||
2021-05-23 11:41:22
I used merge sort but don't understand y it is failing on hidden test cases Last edit: 2021-05-23 11:42:05 |
|||||||||||
2020-11-04 12:49:45
good problem simple bit |
|||||||||||
2020-06-12 16:36:51
Similar Problems https://www.spoj.com/problems/INVCNT/ https://www.spoj.com/problems/YODANESS/ |
|||||||||||
2019-11-10 15:04:25
what a nice problem ! I Solved this using merge sort Time : 0.05s is there any idea to you share with me |
|||||||||||
2019-09-28 14:07:51
Got AC using simple BIT, without any coordinate compression. All those getting TLE check for 0 input. |
|||||||||||
2019-06-17 20:44:40
Same as "count inversion problem" My 150th :) Last edit: 2019-06-17 20:45:01 |
|||||||||||
2019-04-05 22:19:37
Coordinate Compression + BIT |
|||||||||||
2019-01-07 06:40:05
If you use BIT then use coordinate compression, otherwise you'll get TLE. |