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
aj_254:
20190415 20:06:38
https://www.geeksforgeeks.org/findmaximumpossiblestolenvaluehouses/


gs959_me:
20190317 18:43:10
AC in one go !! 

akbar_1214:
20190211 13:50:02
Got wa just because of using int instead of long long


anant6025:
20190206 23:50:24
Dont go deep into loops, try to find a recursive solution, once you are done with that than apply dp and the job is done!


shivam284:
20190122 07:11:30
AC.Good problem with better test cases. 

abitnav:
20190120 16:14:56
AC in one go!! 

abhu:
20181108 09:21:20
N can be 0, handle that :) 

mohamed mokhtar:
20181014 08:42:41
mayank_75, consider the case :


phoemur:
20180912 02:09:26
@mayank_75 While taking only even or odd indices will ensure we visit the maximum number of monsters, it doesn’t guarantee maximum value gathered.


mayank_75:
20180903 15:47:35
can somebody tell me how is this a dp problem, why cant we use simply array and count the sum of odd indices and even indices and then take the max of the two sums?

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 