HDU 1003 Max Sum(简单动态规划)

Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 291739 Accepted Submission(s): 69186

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

Author
Ignatius.L

Recommend
We have carefully selected several similar problems for you: 1176 1087 1069 2084 1058

#include<cstdio>
#include<cstring>
#define INF 0x3f3f3f3f
using namespace std;
int main()
{
    int t;
    int k=0;
    scanf("%d",&t);
    while(t--)
    {
        k++;
        int n;
        scanf("%d",&n);
        int num[100005];
        int temp=0;
        int Max=-INF,x=1,y=1,s=1;
        memset(num,0,sizeof(num));
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&num[i]);
            temp+=num[i];
            if(Max<temp)
            {
                x=s;
                y=i;
                Max=temp;
            }
            if(temp<0)//如果当前的加和小于0，则放弃之前的加和，以下一个数的位置为起始计算位置
            {
                s=i+1;
                temp=0;
            }
        }
        printf("Case %d:\n",k);
        printf("%d %d %d\n",Max,x,y);
        if(t!=0)printf("\n");
    }
    return 0;
}