Cod sursa(job #299896)
Utilizator | Data | 7 aprilie 2009 08:17:25 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream.h>
int v[6000010],n,i,sm=-20000,s,p,u,j;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
f>>n;
for(;i<n;++i)
f>>v[i];
for(i=0;i<n;++i)
{
if(s<0)
{
s=v[i];
j=i;
}
else
s+=v[i];
if(sm<s)
{
sm=s;
p=j;
u=i;
}
}
cout<<sm<<' '<<p+1<<' '<<u+1;
return 0;
}