hdu1003 max sum

 

---

Max Sum

Time Limit: 1000 ms / Memory Limit: 32768 kb

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 14

 

Case 2: 7 1 6

注意一下输出中间有个空行。然以后这是个简单的求连续最大子序列的题

 

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int n,num[201314];
int main()
{
    int t;
    cin>>t;
    for(int ji=1; ji<=t; ji++)
    {
        memset(num,0,sizeof(num));
        cin>>n;
        for(int i=1; i<=n; i++)
            cin>>num[i];
        int beg=1,end=1,sum=0,ans=-5201314,te=1;//te记得初始化赋值为 1 ！
        for(int i=1; i<=n; i++)
        {
            if(sum>=0)
                sum+=num[i];
            else
            {
                sum=num[i];
                te=i;//将新起点暂存起来！
            }
            if(sum>ans)
            {
                ans=sum;
                beg=te;
                end=i;//发现新的sum大于ans，所以此解可行，所以将起点和终点赋值！
            }
        }
        cout<<"Case "<<ji<<":\n";
        cout<<ans<<" "<<beg<<" "<<end<<endl;
        if(ji!=t)//输出格式要求！
            cout<<endl;
    }
    return 0;
}