HDU1003：Max Sum（简单dp）

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#define eps 1e-9
using namespace std;
int a[100010];
int main()
{
int T,n,nowmax,premax,s,x,y;
scanf("%d",&T);
for(int z=1;z<=T;z++)
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
premax=-1000;
nowmax=0;
x=1;
y=1;
for(int i=1;i<=n;i++)
{
nowmax+=a[i];
if(nowmax>premax)
{
s=x;
y=i;
premax=nowmax;
}
if(nowmax<0)
{
x=i+1;
nowmax=0;
}
}
printf("Case %d:\n",z);
printf("%d %d %d\n", premax,s,y);
if(z!=T) cout<<endl;

}
return 0;
}