Pagini recente » Cod sursa (job #2656407) | Istoria paginii runda/bebebucur/clasament | Cod sursa (job #3144651) | Cod sursa (job #184905) | Cod sursa (job #517793)
Cod sursa(job #517793)
#include<iostream.h>
long t,n,i,j,k,s,b,max,l;
int main()
{freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
cin>>n;
j=l=k=1;
max=-1000;
s=b=0;
for(i=1;i<=n;i++)
{cin>>t;
if(b>s)
{b=s;
l=i;}
s+=t;
if(max<s-b)
{max=s-b;
k=i;}
if(l<=k&&s>0&&b<0)
j=l;}
if(max<0)
j=k;
cout<<max<<" "<<j<<" "<<k<<endl;
fclose(stdin);
fclose(stdout);
return 0;}