FARIDA - Princess Farida

Once upon time there was a cute princess called Farida living in a castle with her father, mother and uncle. On the way to the castle there lived many monsters. Each one of them had some gold coins. Although they are monsters they will not hurt. Instead they will give you the gold coins, but if and only if you didn't take any coins from the monster directly before the current one. To marry princess Farida you have to pass all the monsters and collect as many coins as possible. Given the number of gold coins each monster has, calculate the maximum number of coins you can collect on your way to the castle.

Input

The first line of input contains the number of test cases. Each test case starts with a number N, the number of monsters, 0 <= N <= 10^4. The next line will have N numbers, number of coins each monster has, 0 <= The number of coins with each monster <= 10^9. Monsters described in the order they are encountered on the way to the castle.

Output

For each test case print “Case C: X” without quotes. C is the case number, starting with 1. X is the maximum number of coins you can collect.

Example

Input:
2
5
1 2 3 4 5
1
10

Output:
Case 1: 9
Case 2: 10

Added by:hossamyosef
Date:2013-05-13
Time limit:1.237s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:FCIS/ASU Local Contest 2013

hide comments
2013-05-22 02:38:19 johri
what does this mean ----" if and only if you didn't take any coins from the monster directly before the current one."
2013-05-21 20:42:30 Andrys Daniel Silalahi
is this true ?
input :
1
0

ouput :
Case 1: 0

Last edit: 2013-05-21 20:42:51
2013-05-21 19:36:42 Federico Lebrón
Lavanya: Please do not post source code here, remove that from the comment.
2013-05-21 12:15:58 (Tjandra Satria Gunawan)(曾毅昆)
@Lavanya: Your logic is wrong. It's not like that..
2013-05-21 12:04:12 Lavanya
i m using this logic:: arr[n]=max(arr[n-2],arr[n-3])+arr[n]; giving conditions for cases n=1 and n=2 .and i m using long long datatype in c!!! i have got many wrong answers..plz help!!
2013-05-20 22:42:09 raunakrocks
nice problem AC!!
2013-05-20 15:17:25 [Lakshman]
@coding No tricky test case..use O(n) algorithm..
2013-05-20 09:11:37 Chandler Bing
output format costed me multiple WA .
2013-05-20 08:30:57 coding
me getting tle...any tricky test cases plzzzzzz.........
2013-05-19 12:37:48 [Lakshman]
Finally AC after 8 WA..nice problem...
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.