HDU 1003 Max Sum

来源:互联网 发布:喜当爹 知乎 编辑:程序博客网 时间:2024/06/16 15:19
#include <iostream>#include <cstring>using namespace std;int main(){    int m,n,i,j,k,d,sum,a[100010],b[100010],z=1;    cin>>m;    while(m--)    {        int max=-111111,start,end,t=1;        memset(a,0,sizeof(a));        memset(b,0,sizeof(b));        cin>>n;        for(i=1; i<=n; i++)            cin>>a[i];        int sum=0;        for(k=1; k<=n; k++)        {            sum=sum+a[k];            if(sum>max)            {                max=sum;                start=t;                end=k;            }            if(sum<0)            {                sum=0;                t=k+1;            }        }        cout<<"Case "<<z++<<":"<<endl;        cout<<max<<" "<<start<<" "<<end<<endl;        if(m)            cout<<endl;    }    return 0;}

0 0
原创粉丝点击