DCEPC501 - Save Thy Toys

Leonard is very fond of buying rare and expensive science fiction toys. He keeps his collection in a sequential order of the date on which the toy was bought in a special closet so that his roomie Sheldon never gets hold of his toys. But because of his bad luck Leonard once loses a bet to Sheldon and Sheldon demands a share Leonard’s toys. Since Leonard doesn’t want to loose much money, he decides upon a strategy to reduce his loss to minimum.

Leonard, beginning from the first toy in his closet will pick some toys, say "x" toys in sequence. Sheldon will then pick the next "x" toys (Note that Sheldon picks equal no. of toys as picked by Leonard in his move unless the remaining toys are less than "x". In that case he picks all of the remaining). This will keep going on till no more toys are left in the closet for Leonard to pick. You are given the sequence of toys with their price. Help Leonard in maximizing the total price of all toys he picks.

Leonard in his each turn can either pick only 1 or 2 or 3 toys ("x" described above can take value either 1, 2 or 3).

Input

First line specifies T, the number of test cases.

Each test case contains N in the first line. Second line contains N integers as described above.

Output

Output 1 line for each test case giving the maximum possible value of the total sum of all toys Leonard picks.

Constraints

1<=T<=10

1<=N<=100000

1<=Price of toys<=1000000

Example

Input:
2
4
5 4 3 2
6
10 8 7 11 15 20

Output:
12
53

Explanation:

In 1st case, Leonard picks 3 toys in his first move with value 5,4,3 and Sheldon has no choice but to pick the last.
In 2nd case, Leonard picks 10, 8. Then Sheldon picks 7,11. And then Leonard picks the rest.


Added by:dce coders
Date:2012-04-18
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:ASM32-GCC MAWK BC C-CLANG C NCSHARP C++ 4.3.2 CPP CPP14 CPP14-CLANG COBOL COFFEE D-CLANG D-DMD DART ELIXIR FANTOM FORTH GOSU GRV JAVA JS-MONKEY JULIA KTLN NIM NODEJS OBJC OBJC-CLANG OCT PICO PROLOG PYPY PYPY3 PY_NBC R RACKET RUST CHICKEN SQLITE SWIFT UNLAMBDA VB.NET
Resource:Own Problem

hide comments
2016-06-09 18:30:08
Converted top-down to bottom-up and then found
out that the problem was with cin and cout
2016-06-02 09:03:57
Nice problem
got WA due to silly mistake in max function
2016-05-18 09:57:23
Do not use cin. cost me TLE. Finally completed 100 problems :))
2016-05-17 11:13:27
Bottom-Top with Scanf and Printf :)
Cout and Cin will make you suffer WA's :p

Last edit: 2016-05-17 11:14:28
2016-01-22 18:26:47
nice problem :)
2015-10-19 10:27:22
Why tle :(
EDIT: If you are using cin/cout then add ios::sync_with_stdio(false);
in the beginning in the main() function.

Last edit: 2015-10-19 10:35:01
2015-08-26 20:51:23
Ad-hoc -> WA
2015-08-06 18:21:40 anshal dwivedi
Nice problem! AC in one go..!
2015-08-04 12:31:09 Mayank Garg
..yeah @abhijeet ... AC in one go :)
2015-08-04 12:29:07 ABHIJEET
1 wa due to silly mistake... well.. cakewalk it is!! :D
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.