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-11-13 20:03:54
Thanks @rmaurya for the hint ; )

Last edit: 2016-11-13 20:04:09
2016-11-10 20:31:55
take care for n=0
2016-11-02 05:53:03
My First DP with AC in ONE GO (-_-)
2016-10-18 20:00:24
1 3 5 9 7 10 1 10 100
how ans is 122
2016-10-18 20:00:16
AC 0.02 but not get 0.00
2016-10-18 19:59:53
AC 0.02 but not get 0.00
2016-10-18 04:24:17
I use bottom Up dp but i got TLE, i don't have any idea to solve it
2016-09-29 00:17:38
Recursive O(n) gives TLE
Non Recursive O(n) in 0.24 O_o :p
2016-08-28 16:25:21 imwrkhrd
I thought my solution is quite fast (0.05s), but the best answers took 0s.
How did they do it?
2016-08-21 19:36:32
problem is easy and good for beginner as far as DP is concerned. Instead of DP in this problem that data types and their choice matters.
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.