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
2015-03-13 11:07:57 chandan
its capital C in case
2015-03-03 13:38:33 Vivek Sahu
the output format needs '\n' at the end.
2015-01-16 18:34:08 Shivam Mitra
O(n) :D
2014-10-16 22:39:17 Pritam Prakash
good one.
2014-07-19 11:50:03 Ankit
Brought down the complexity from O(n^2) to O(n) and got the result accepted from TLE! :)
2014-07-13 04:21:56 mashiro
Don't give up; after the 9th AC
2014-06-02 09:57:58 Mitch Schwartz
@Mohit Pandey: Asking questions is good, but why stop there? You can also investigate the answer. The compiler operates in a predictable (and usually well-documented) way, which would enable you to say whether two pieces of code would have identical behavior for all inputs, or if they would behave differently on certain inputs. If, for example, you were able to infer some strange aspect of the input formatting, you could leave a useful comment about it. As it is now, you are just advertising the fact that you don't fully understand the code you have written.

Last edit: 2014-06-02 09:58:57
2014-06-02 09:24:04 Mohit Pandey
solution got accepted with cin and cout, wrong answer with ... scanf,printf..
Why?

Last edit: 2015-03-14 18:51:48
2014-02-03 23:21:15 Mitch Schwartz
The sentence "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" is incorrect or at best confusing; for clarity, we could change "if and only if" to "only if", or "give" to "offer" (or both).

Last edit: 2014-02-04 00:09:04
2013-11-09 06:08:25 nondescript
:D

Last edit: 2013-11-09 06:09:01
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.