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
Dragan Markoviæ:
2013-05-28 20:04:57
int overflows... the problem description is wrong. Use long long. Last edit: 2013-05-28 20:05:14 |
|
Atul Kumar Verma:
2013-05-28 13:07:14
My First DP :) |
|
Hector Navarro:
2013-05-26 03:32:18
There shouldn't be any long long answers since worst case should be 1000/2*10^6=500x10^6 |
|
$!:D:
2013-05-24 16:23:42
long int gives WA
|
|
Mayank gupta:
2013-05-24 12:10:12
Guyz Beware of n=0 Print "0" condition...
|
|
Mayank gupta:
2013-05-24 12:06:09
Finally...I married Princess Farida using O(n) algorithm....:P
|
|
Anuj_LuckFove!:
2013-05-24 11:57:52
simple DP will get u AC..just remember to print the output as given..costed me a WA.. |
|
coding:
2013-05-22 12:18:51
plzz..give more hint...still tle..i m first selecting highest no. of coins and neglecting the monster on either side of it...then select the highest one again and add and so on...i think selecting the highest no. giving tle..plzz suggest optimzations... |
|
[Lakshman]:
2013-05-22 09:51:34
@Andrys Daniel Silalahi yes this is correct...
|
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 |