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

hide comments
pk201996: 2017-07-05 09:05:05

i am not understanding after checking each and every worst case on my compiler the answers are correct but i got runtime error in spoj.Why??

monukumar: 2017-07-01 20:22:38

Cakewalk!! used a 3*n dp table..

ankit1cool: 2017-06-15 08:49:09

n=0 caused me i runtime so keep that in mind

rohit9934: 2017-06-13 16:01:37

9
1 3 5 9 7 10 1 10 100
For This Case.
Right Ans: 122
My ans: 116
I thought i was missing something but still got AC.

rishabhm123: 2017-06-11 21:08:26

Please guyss...even use the rray as long long int
Though am unable to understand that how <=10^9 is not under "int"..
Anyone with a slightest of help

chotukv: 2017-06-11 07:17:56

my first dp feeling gr8..!! ac in 1 go with some help...

bharatgoyal: 2017-06-07 15:33:04

Use long long for everything, cost me 5 WAs

bmay: 2017-06-02 15:33:55

Python cases have malformed coin input. Beware.

leafbebop: 2017-06-02 08:04:11

Spamming lots of test cases to my code, only to realize that I write "Case #x" instead of "Case X".
I must have had too much GCJ.

Last edit: 2017-06-02 08:04:54
da_201501181: 2017-05-30 22:29:29

# IMPORTANT TEST CASES

Input:
8
5
1 2 3 4 5
1
10
3
2 4 3
0
9
1 3 5 9 7 10 1 10 100
4
4 3 2 1
2
5 2
3
2 5 2

Output:
Case 1: 9
Case 2: 10
Case 3: 5
Case 4: 0
Case 5: 122
Case 6: 6
Case 7: 5
Case 8: 5

Thanks to comments..!!

Last edit: 2017-05-30 22:31:06

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