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
kaush1:
2018-06-20 14:02:29
Remember to print Case number also. I forgot to print case... |
|
itachi_2016:
2018-06-14 13:24:06
Take care for n = 0, my 50th :p Last edit: 2018-06-16 14:32:14 |
|
dennislo:
2018-06-12 19:26:43
Easy DP problem, but remember to use long |
|
theabd123:
2018-06-01 07:12:04
Finally Solved it ..use Bottom up Dp |
|
wrzoboo:
2018-05-25 16:45:02
ac in 1 go in python 3
|
|
lawfulrainbow:
2018-04-19 13:11:21
Hit myself so hard when I realised I did everything right but got a wrong answer because I used %d instead of %llu while printing. |
|
lostground97:
2018-02-20 18:58:23
50th! ^_^ |
|
Andrzej Stefan Janusz:
2018-02-02 18:35:57
If n=0 then input looks like this:
|
|
genta:
2018-02-01 08:29:42
easy dp problem ever.
|
|
ramini1996:
2018-01-31 09:11:58
Recursion + Memoization = AC in one GO !!! |
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 |