User:
Password:
for today
Log In
register
tutorials
status
submit
problems
search
ideone.com
Submit
All submissions
Best solutions
PS
Lubi to!
Udostpnij
Back to list
news
contests
ranks
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
Leonards toys. Since Leonard doesnt want to loose much money, he decides upon a strategy to reduce his
loss to minimum.
forum
tools
clusters
credits
jobs
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.
Se rve r tim e :
2014-09-05
15 : 51 : 53
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:Time for a new job?
2
4
5432
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:
Date:
Time limit:
Source limit:
Memory limit:
Cluster:
Languages:
Resource:
dce coders
2012-04-18
3s
50000B
256MB
Pyramid (Intel Pentium III 733 MHz)
C C++ 4.3.2 C++ 4.0.0-8 JAVA NODEJS PYTH 3.2.3 n
Own Problem
hide comments
Previous
Next >
http://www.spoj.com/problems/DCEPC501/
1/2
9/5/2014
About SPOJ
#spoj at freenode
RSS
Spoj.com . All R ights R e se rve d. Spoj use s Sphe re Engine by Sphe re R e se arch Labs.
http://www.spoj.com/problems/DCEPC501/
2/2