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
lostground97:
20180220 18:58:23
50th! ^_^ 

Andrzej Stefan Janusz:
20180202 18:35:57
If n=0 then input looks like this:


genta:
20180201 08:29:42
easy dp problem ever.


ramini1996:
20180131 09:11:58
Recursion + Memoization = AC in one GO !!! 

sayasaiteja:
20180123 13:18:11
ac in one go!!! 

Huan Zhou:
20180103 09:30:21
Hi there!


sanyam19:
20180101 08:43:43
good DP... one should do it :) 

karthik1997:
20171230 16:21:21
Nice O(N) problem .O(1) space . Long is enough for C++(gcc 6.3) dudes :) Last edit: 20171230 16:45:20 

abhar10:
20171126 14:26:43
Easy DP problem


madhur4127:
20171126 07:50:43
Nuances:

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 