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
DHEERAJ KUMAR:
2015-06-06 22:09:03
Finally AC after so many tle. 3rd DP :D |
|
:.Mohib.::
2015-05-31 21:18:15
Finally AC :) just love dp.... ;) |
|
Dushyant Singh:
2015-05-24 08:21:01
Can this question be done without DP? |
|
Rameshwar:
2015-05-11 19:58:22
First DP :D
|
|
Shubham Sinha:
2015-05-07 18:43:55
My first DP problem !!!! |
|
evlmnd:
2015-04-23 15:20:32
AC after 5th!!
|
|
aniruddha_paul:
2015-04-21 18:03:12
compilation error.I haven't used getch() and included #include<stdio.h> |
|
Hunnybunch:
2015-04-10 18:06:57
test cases sahi se bnaya kr bhai :D :D |
|
Jaswanth:
2015-04-05 17:52:07
My first DP got WA but with fast input :):):) AC |
|
xxbloodysantaxx:
2015-03-24 11:46:58
Basic DP |
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 |