Submit | All submissions | Best solutions | Back to list |
WAL3A - Khairy and Gold Alloys |
We all know "Connect 4 Game", One day Khairy has a grid with infinite height and n numbers representing the number of discs in the ith column. It's guaranteed that no empty cells between any discs in the same column. for each disc in the grid if Khairy saw a disc on its left OR its right, he'll say "Wal3a". Given the N numbers, What's the maximum number that Khairy will say "Wal3a"!
Khairy is a small guy who likes gold very much, but he has a problem in his eyes and the word "WAL3A" (WAL3A in Arabic means "Firing"), whenever he likes something very much sooner or later it is destroyed by any means (Please don't impress him with something you want :|)
One day Khairy visited the National Museum and saw a Grid with infinite height and N columns and each column i contains Xi Gold Alloys. No empty cells between Alloys in the same column.
Unfortunately all Gold Alloys that impress Khairy in the 1st row are destroyed and disappeared :S, consequently the Alloys of the same columns above the destroyed Alloys fall to the the cell which is directly below it (each affected column height is decreased by 1 unit). Khairy continues saying "WAL3A" till he finds the first row not impressing anymore.
The example below Khairy would say "WAL3A" twice and 7 gold alloys are destroyed.
Of course the museum lost a fortune during Khairy's visit, so could you help the government find how many Gold Alloys are destroyed by Khairy.
Input
The first line of input contains an integer T (1 <= 20 <= T) followed by T test cases.
Each test case contains a positive integer N [1 <= N <= 105] followed by N integers [0 <= Xi <= 109] separated by spaces (see sample input for more clarification).
Output
For each test case output one line contains how many Gold Alloys are destroyed by Khairy.
Example
Input: 2
5
1 2 2 1 5
3
7 7 7 Output: 7
21
Added by: | eagle93 |
Date: | 2014-03-22 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
hide comments
2016-10-31 08:17:52
Bad statement |
|
2015-12-30 09:50:46
Nice .. AC in 3rd attempt.. Corner case of n == 1 cost me 2 WA.. |
|
2015-06-01 08:35:12 candide
Storyboard problem is rather cumbersome and once understood, the problem is trivial. |
|
2014-07-05 17:20:14 THE_SCORPION
any hint ??? ?! |
|
2014-03-29 11:35:27 Francky
@psetter : Could you give the size in kB of input file? It seems low compared to constraints. |