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.


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.


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.


1 2 3 4 5

Case 1: 9
Case 2: 10

hide comments
sanyam19: 2018-01-01 08:43:43

good DP... one should do it :)

karthik1997: 2017-12-30 16:21:21

Nice O(N) problem .O(1) space . Long is enough for C++(gcc 6.3) dudes :)

Last edit: 2017-12-30 16:45:20
abhar10: 2017-11-26 14:26:43

Easy DP problem
Just coz of "Case " before output caused me 1 WA

madhur4127: 2017-11-26 07:50:43

1. Check for n==0 (No line thereafter)
2. Prepend answer with "Case _ _:"
3. Use long long
Has elegant bottom up DP solution!

Last edit: 2017-11-26 07:51:17
chetan_555: 2017-11-19 08:16:20

My first dp problem.. finally solved

chetan_555: 2017-11-19 08:10:55

thank you @anjn98

vibhanshu_26: 2017-11-15 22:16:37

AC in one Go!! :)

anjn98: 2017-10-27 09:10:04

Guys use long long int to store number of coins. Using int gave me a WA

v_pp_27: 2017-10-21 05:59:18

check for n=0
got 1 WA cause of that.

rehanrahi: 2017-10-08 18:25:30

guys if you dont want to use dp! then no problem this can be solved by one another method.this ques is indirectly given like this suppose you have one array and you have to find max sum such that no two elements are adjacent.hope you will get the hint

Added by:hossamyosef
Time limit:1.237s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:FCIS/ASU Local Contest 2013