Max Sum(HDU1003)最大连续子序列和

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

解题思路

简单经典DP，转移方程:sum[i]=max(sum[i-1]+a[i],a[i])

Code:

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<math.h>
using namespace std;
int main()
{
    int T;
    cin>>T;
    for(int k=1;k<=T;k++)
    {
        int n,a,b,A,B,t;
        cin>>n;
        int sum=-1001,max=-1001; 
        for(int i=1;i<=n;i++)
        {
            cin>>t;
            if(sum+t<t)
                sum=t,a=b=i;
            else
                sum+=t,b++;
            if(sum>max)
                max=sum,A=a,B=b;
        }
        printf("Case %d:\n%d %d %d\n",k,max,A,B);
        if(k!=T)cout<<endl;
    }
    return 0;
}