Cod sursa(job #496519)
Utilizator | Tudor Popa crazzytud | Data | 29 octombrie 2010 15:18:02 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream.h>
const long N=6000001;
long v[N];
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
//freopen("ssm.in","r",stdin);
//freopen("ssm.out","w",stdout);
long n,i,i1,i2,smax,s=0,i3;
in>>n;
for(i=1;i<=n;i++)
in>>v[i];
smax=v[1];
for(i=1;i<=n;i++)
{
if(s<0)
{
s=0;
i1=i;
}
s+=v[i];
if(s>smax)
{
smax=s;
i2=i;
i3=i1;
}
}
//printf("%ld %ld %ld",smax,i3,i2);
out<<smax<<" "<<i3<<" "<<i2;
return 0;
}