hdu-----1003-----Max Sum

http://acm.hdu.edu.cn/showproblem.php?pid=1003

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

25 6 -1 5 4 -77 0 6 -1 1 -6 7 -5

 

Sample Output

Case 1:14 1 4Case 2:7 1 6

代码实现：

#include <iostream>using namespace std;int main(){    int t,n,max,sum,start,end,i,j,tmp,lastStart;    while(cin>>t)    {        for(i=1; i<=t; i++)        {            cin>>n;            max=-1001;            sum= 0;            lastStart=1;            for(j=1; j<=n; j++)            {                cin>>tmp;                sum+=tmp;                if(sum> max)                {                    start=lastStart;                    end=j;                    max = sum;                }                if(sum< 0)                {                    lastStart = j+1;                    sum= 0;                }            }            cout<<"Case "<<i<<":"<<endl;            cout<<max<<start<<end;            if(i!=t)                cout<<endl;        }    }    return 0;}