杭电 1003 Max Sum （动态规划）

参考：https://www.cnblogs.com/yexiaozi/p/5749338.html

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int N=1e5+10;
int a[N],dp[N];
int n;
void test()
{
    cout<<"\n---------\n";
    for (int i=0;i<=n;i++)
    {
        cout<<'['<<a[i]<<']';
    }
    cout<<endl;
    for (int i=0;i<=n;i++)
    {
        cout<<'['<<dp[i]<<']';
    }
    cout<<"\n------------\n";
}
int main()
{
    int t;
//    freopen("btext.txt","r",stdin);
    while (cin>>t)
    {
        for (int ca=1;ca<=t;ca++)
        {
            cin>>n;
            int ans=-N,s,e;
            memset(a,0,sizeof(a));
            memset(dp,0,sizeof(dp));
            for (int i=1;i<=n;i++)
            {
                cin>>a[i];
                dp[i]=max(dp[i-1]+a[i],a[i]);
//                test();
                if (dp[i]>ans)
                {
                    ans=dp[i];
                    e=i;
                }
            }
            int sum=0;
            for (int i=e;i>=1;i--)
            {
                sum+=a[i];
                if (sum==ans)//要求第一个例子，所以不能break!
                {
                    s=i;
                }
            }
            cout<<"Case "<<ca<<':'<<endl;
            cout<<ans<<' '<<s<<' '<<e<<endl;
            if (ca!=t)//注意格式！
            {
                cout<<endl;
            }
        }
    }

    return 0;
}