hdu 1003 Max Sum

来源：互联网发布：精华液推荐知乎编辑：程序博客网时间：2024/04/30 11:25
#include<iostream>#include<vector>#include<string.h>#include<set>#include<stack>#include<algorithm>#include<map>#include<list>#include<queue>#include<stdio.h>#include<math.h>#include<stdlib.h>#include<ctype.h>#include<iomanip>using namespace std;#define LL long long#define pi acos(-1)#define N 100010int a[N];int main(){    //freopen("a.txt","r",stdin);    int i,j,k;    int n;    int t;    scanf("%d",&t);    for(k=1;k<=t;k++)    {        scanf("%d",&n);        int sum=-1001;        int b=-1001;        int s=1;        int st=1;int end=1;        for(i=1;i<=n;i++)        {            scanf("%d",&a[i]);            if(b>=0)            {                b+=a[i];            }            else            {                b=a[i];                s=i;            }            if(b>sum)            {                sum=b;                st=s;                end=i;            }        }        printf("Case %d:\n",k);        if(k!=t)        printf("%d %d %d\n\n",sum,st,end);        else        printf("%d %d %d\n",sum,st,end);    }    return 0;}