Cod sursa(job #518326)
Utilizator | Data | 31 decembrie 2010 09:49:09 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<iostream.h>
long n,i,j=1,k=1,s=0,b=0,max=-1000,l=1;
int t;
int main()
{fopen("ssm.in","rt");
fopen("ssm.out","wt");
cin>>n;
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)
j=l;}
if(max<0)
j=k;
cout<<max<<" "<<j<<" "<<k;
return 0;}