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
2013-05-18 18:10:43 (Tjandra Satria Gunawan)(曾毅昆)
finally I got AC without using 64-bit integer, just overflow manipulation ;-)
2013-05-18 15:48:51 (Tjandra Satria Gunawan)(曾毅昆)
the correct constraints is: "0 <= The number of coins with each monster <= 1,000,000,000" please change problem description

Last edit: 2013-05-18 18:22:36
2013-05-18 04:51:22 Mitch Schwartz
@RAJDEEP GUPTA and @Surendra
As a general remark: You should use an assert that directly tests whether the input meets the stated constraints. It can be as simple as "if (n > MAXN) return 1;" and look for NZEC. In this way, you have proof for the incorrectness of the test data that doesn't rely on correctness of your analysis. It also makes it very obvious how the problem setter should change either the data or the constraints to be in agreement.
2013-05-18 04:28:11 ­Surendra
@Admin : Please write the correct constraint in the problem. Answer is exceeding 32 bit, but it shouldn't happen according to given constraint.

Last edit: 2013-05-18 04:28:46
2013-05-17 18:36:52 RAJDEEP GUPTA
I had to use long long for the answer, although according to the problem constraint int should have been ok. Got 2 WA for this.
2013-05-17 00:03:44 Kumar Mrinal
tutorial stuff :D
2013-05-17 00:03:44 Utkarsh Shahdeo
Watch out for n=0
2013-05-17 00:03:44 Rajarshi Sarkar
Nice problem :)

Last edit: 2013-05-16 10:24:11
2013-05-17 00:03:44 Muh. Aunorafiq Musa
@hamdi :
9
1 3 5 9 7 10 1 10 100
Case 1: 122

Last edit: 2013-05-15 18:02:27
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.