HDU——1003 Max Sum（dp 最大子段和 ！！）

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>
#include <cstring>
using namespace std;

int num[100010] = {0};
int main(){
    int t , n , i , x = 0 , y = 0 ,k = 0 ,sum = 0  , ans = -0x3f3f3f3f ,te;
    scanf("%d" , &t);
    int temp = t;
    while( t --){
        k ++;
        x = 0 ;
        y = 0 ;
        sum = 0  ;
        ans = -0x3f3f3f3f;
        te =1;
        scanf("%d" , &n);
        memset(num , 0 , sizeof(num));
        for(i = 1 ; i <= n ; i ++)
            scanf("%d",&num[i]);

        x = 1;
        y = 1;


//方法一  AC
        for(i = 1 ; i <= n ; i ++){
            if(sum >= 0){
                sum = sum + num[i];
            }else{
                sum = num[i];
                te = i;
            }
            if(sum > ans){
                ans = sum;
                x = te;
                y = i;
            }
        }
 //方法二 WA   区别一下（哪里错了）
        /*for(i = 1 ; i <= n ; i ++){
            if(sum >= 0){
                sum = sum + num[i];
                if(sum > ans){
                    ans = sum;
                    y = i;
                }

            }else{
                sum = num[i];
                if(sum > ans){
                    ans = sum;
                    x = i ;
                    y = i;
                }
            }
        }*/

        printf("Case %d:\n",k);
        printf("%d %d %d\n",ans , x , y);
        if(k != temp)
            printf("\n");
    }
    return 0;
}