Cod sursa(job #515830)
Utilizator | Data | 22 decembrie 2010 15:10:46 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<iostream.h>
#define N 6000001
int main()
{long n,i,j=1,max=-N,k=1,s=0,b=0,t,j1=1;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
cin>>n;
for(i=1;i<=n;i++)
{cin>>t;
if(b>=s)
{b=s;
j1=i;}
s+=t;
if(max<=s-b)
{max=s-b;
k=i;
if(j1<=k)
j=j1;}}
cout<<max<<" "<<j<<" "<<k;
fclose(stdin);
fclose(stdout);
return 0;}