（解题报告）HDU1003---Max Sum

Max Sum

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 188869 Accepted Submission(s): 43986

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

解题思路：
1. 题目理解：输入一串数字，然后输出连续的几个数之和中最大的，这个子数列的起始项，结束项（注意如果前面几项之和如果为0那么第一项为第一个正数：见sample output中第二个例子）；
2. 开始设一个MAX等于最小值，然后把每项叠加后的和与其比较，如果比其大就重新赋值，并且更改结束的位置，如果和小于0，则从下一位重置起始值与和。
3. 格式控制的问题：注意换行应在每个非1测试用例的前面。

具体代码如下:

#include <stdio.h>      //动态规划 
int main()
{
    int n,T,m;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&T);
        int sum=0,k=1,end=1,start=1;     //用k表示每次最大和的开始  
        int Max=-1001;                   
        for(int j=1;j<=T;j++)
        {
            scanf("%d",&m);
            sum+=m; 
            if(sum>Max)
            {
                Max=sum;
                start=k;
                end=j;
            }
            if(sum<0)
            {
                sum=0;
                k=j+1;
            }
        }
        if(i!=1)printf("\n");  //格式的控制！！！ 
        printf("Case %d:\n",i);
        printf("%d %d %d\n",Max,start,end);

    }
    return 0;
 } 

仅代表个人观点。