Max Sum(简单DP)

题目链接：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<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
using namespace std;

int main()
{
    int t;
    int n;
    int x;
    scanf("%d",&t);
    for(int k = 1; k <= t; k++)
    {
        int sum = 0;
        int mmax = -1001;//max的值需要足够小，看题目给的数据范围
        int tmp = 1;//用来标记可能成为左端点的点
        scanf("%d",&n);
        int l = 1;//左端点
        int r = n;//右端点
        for(int i = 1; i <= n; i++)
        {
            scanf("%d",&x);
            sum += x;//当前位置的和
            if(sum > mmax)
            {
                mmax = sum;
                r = i;
                l = tmp;//能够更新最大值的时候我们再更新左端点
            }
            if(sum < 0)
            {
                sum = 0;
                tmp = i+1;//这个位置可能是左端点，标记
            }
        }
        printf("Case %d:\n%d %d %d\n",k,mmax,l,r);
        if(k != t)//这个地方一定不能直接加换行，直接加换行是会格式错误的
        	printf("\n");
    }
    return 0;
}