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

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

hide comments
2016-08-19 08:21:58
Able to have AC after some time. :)
2016-08-13 15:12:14
easy problem.... use long long in dp array.... happy coding :-)
2016-08-02 08:39:30 Ray Brish Bhanu
declare dp array as global..coz long long int type
2016-07-29 17:42:39 Harshita
My code is running correctly on ideone and codeblocks but when I submit it, SPOJ generates a message that says it the wring ans.
2016-07-27 23:27:30 JITENDRA SINGH
Why have you(SPOJ) deleted my post??? Now who will tell me that what was wrong in my solution

Last edit: 2016-07-27 23:27:51
2016-07-19 20:02:13
AC in one go.....Avoid recursive solutions of DP whenever possible
2016-06-30 22:33:02
Silly mistake of forgetting long long int in max(). Don't forget and pay attention to N=0. Happy coding :)
2016-06-27 16:22:15
AC in ONE GO!!!!!!!!!
2016-06-24 12:51:31 Shubham Gupta
Recursive sol with O(n) approach also getting TLE.
^Any clue how to go about it?

AC with non-recursive approach. 0.08s

Last edit: 2016-06-24 12:52:35
2016-06-10 09:59:02
AC ! on one attempt !!
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.