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
horizon121:
20170829 15:28:09
Guyz write the "Case " number got me 1 WA!!Easy dp!!! 

kxingh:
20170819 12:47:41
cheq for monster=0 

nikhil2504:
20170801 02:23:06
Little mistake costed W.A


abhi_96:
20170730 08:28:02
it's capital 'C' in case.cost me 1 WA. 

nietaki:
20170723 18:59:46
There seem to be extra whitespace characters in the input :/ 

xaer0_:
20170709 13:59:55
n = 0. Good catch from guys in the comments.


jayu_jd:
20170708 06:21:08
Simple Question !


pk201996:
20170705 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:
20170701 20:22:38
Cakewalk!! used a 3*n dp table.. 

ankit1cool:
20170615 08:49:09
n=0 caused me i runtime so keep that in mind 
Added by:  hossamyosef 
Date:  20130513 
Time limit:  1.237s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  FCIS/ASU Local Contest 2013 