HDU 1003: Max Sum

HDU 1003: 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 

---

题解

相当于求出单调序列中最大值与最小值的差……

---

代码

#include<cstdio>
using namespace std;

int n,tt,t,a,sta,end,max,k;

int main()  
{
    scanf("%d",&t);
    for(int i=1;i<=t;i++)
    {
        scanf("%d",&n);
        max=-1e9;tt=0;
        sta=end=k=1;
        for(int j=1;j<=n;j++)
        {
            scanf("%d",&a),tt+=a;
            if(tt>max) max=tt,sta=k,end=j;
            if(tt<0) tt=0,k=j+1;
        }
        if(i!=1) printf("\n");
        printf("Case %d:\n",i);
        printf("%d %d %d\n",max,sta,end);
    }
}