Cod sursa(job #295678)
| Utilizator |  Koos Tiberiu Iosif tibilets |
Data | 3 aprilie 2009 16:40:44 |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream.h>
int S[7000000],N,i,sm=-20000,s,p,u,j;
int main(void)
{ifstream f("ssm.in");
ofstream g("ssm.out");
f>>N;
for(;i<N;++i)
f>>S[i];
for(i=0;i<N;++i)
{if(s<0)
{s=S[i];
j=i;}
else
s+=S[i];
if(sm<s)
{sm=s;
p=j;
u=i;}
g<<sm<<' '<<p+1<<' '<<u+1;
return 0;
}