动态规划最大子序列之hd1003

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
    int t,n,a,cot=1;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        int i,temp=1,ans=0,f=0,l,maxsum=-1001;
        for(i=0;i<n;i++)
        {
            scanf("%d",&a);
            ans+=a;
            if(ans>maxsum)
            {
                maxsum=ans;
                f=temp;
                l=i+1;
            }
            if(ans<0)
            {
                ans=0;
                temp=i+2;
            }
        }
        printf("Case %d:\n%d %d %d\n",cot++,maxsum,f,l);
        if(t>0)
        printf("\n"