Max Sum（经典DP）

#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <stack>
using namespace std;

#define mem(a,b) memset(a,b,sizeof(a))
#define pf printf
#define sf scanf
#define debug printf("!\n")
#define INF 10000
#define MAX(a,b) a>b?a:b
#define blank pf("\n")
#define LL long long

int n;
int dp[100010];
int a[100010];
int s[100010];

int main()
{
          int i,j,t,k;
          sf("%d",&t);
          for(k = 1;k<=t;)
          {
                    sf("%d",&n);
                    mem(dp,0);
                    mem(a,0);

                    for(i = 0;i<n;i++)
                    {
                              sf("%d",&a[i]);
                    }
                    dp[0]=a[0];
                    int e=1;
                    for(i = 1;i<n;i++)
                    {
                              if(dp[i-1]>=0)
                              {
                                        dp[i] = max(dp[i-1]+a[i],a[i]);
                                        s[i] = s[i-1];
                              }
                              else
                              {
                                        dp[i] = a[i];
                                        s[i] = i;
                              }
                    }
                    int max = -1000;
                    for(i=0;i<n;i++)
                    {
                              if(max<dp[i])
                              {
                                        max = dp[i];
                                        e=i;
                              }
                    }
                    pf("Case %d:\n",k);
                    pf("%d %d %d\n",max,s[e]+1,e+1);
                    k++;
                    if(k<=t)
                              blank;

          }
}