动态规划 最大子序列和

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<set>
#include<math.h>
#define IN 1<<28
#define ll long long
using namespace std;
ll T, num[100005], dp[100005], Left[10005];
int main()
{
    scanf("%d", &T);
    for( int t = 1; t <= T; t++ )
    {
        int N;
        scanf("%d", &N);
        memset(num, 0, sizeof(num));
        memset(dp, 0, sizeof(dp));
        memset(Left, 0, sizeof(Left));
        ll max_res = 0;
        for( int i = 1; i <= N; i++ )
        {
            scanf("%lld", &num[i]);
            max_res = min( max_res, num[i]);
        }
        ll left = 0, right = 0, tmp = 0;
        dp[1] = num[1];
        Left[1] = 1;
        if( dp[1] > max_res )
        {
            max_res = dp[1];
            left = 1;
            right = 1;
        }
        for( int i = 2; i <= N; i++ )
        {
            if( dp[i-1] > 0 )
            {
                dp[i] = num[i] + dp[i-1];
                Left[i] = Left[i-1];
            }
            else
            {
                dp[i] = num[i];
                Left[i] = i;
            }
            if( dp[i] > max_res )
            {
                max_res = dp[i];
                left = Left[i];
                right = i;
            }
        }
        printf("Case %d:\n", t);
        printf("%lld %lld %lld\n", max_res, left, right);
        if( t != T )
             printf("\n");
    }
}