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
BadeMeow: 2015-07-14 12:03:43

Take care of n = 0

kp: 2015-07-07 07:49:14

ac in one go ~ thanks for the comments :D

Ayushi: 2015-07-02 22:25:34

Can anybody tell me what's wrong with my code: https://ideone.com/s89fnR
It is giving correct answers for all the test cases I can think of but still showing WA

Last edit: 2015-07-02 22:26:44
aparna00: 2015-07-02 12:38:43

not using 'long long' rewarded me with 4 W.A :|

vedaytas: 2015-07-01 05:27:55

Easy DP . Beginners should try this out

Vishal: 2015-06-20 19:56:22

case n=0 cost 3 wrong answer

SangKuan: 2015-06-20 18:12:02

easy,get ac after use long long

r0bo_dart: 2015-06-16 09:31:19

Though everyone says long long for the input. Make sure not to use long long just for the value in the vector. Even the 0 <= N <= 10^4 is wrong. Use long long for that too.
This is stupid. It has cost me 3 WA for this such an easy problem.

priyank: 2015-06-10 07:46:43

take care of case when n=0 ,test case is
2
0

5
1 2 3 4 5
output:
Case 1: 0
Case 2: 9

Aman Agarwal: 2015-06-08 08:52:00

Easy Dp..5 WA due to this test case
1
2
5 2
output:
Case 1: 5


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