hdu1003

maksyuki 发表于 oj 分类,标签:
0

Max Sum

Problem Description

Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.

Input

The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).

Output

For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.

Sample Input

2
5 6 -1 5 4 -7
7 0 6 -1 1 -6 7 -5

Sample Output

Case 1:

14 1 4

Case 2:

7 1 6

Author

Ignatius.L

 

题目类型:线性DP

算法分析:这是求最大子序列和的经典问题,ans[i]定义为第i个数字之前的最大子序列和,val[i]为读入的int型数组,状态转移方程为:如果ans[i-1] < 0, 则ans[i] = val[i];否则ans[i] = ans[i-1] + val[i]