Cod sursa(job #307467)
Utilizator | Data | 24 aprilie 2009 10:38:48 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream.h>
long long z,n,i,c,y,s,yy,x,xx,max;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
s=0;
max=-200000000;
for (i=1;i<=n;i++)
{
f>>c;
if (s<0){s=c;z=i;}
else s=s+c;
if(max<s){max=s;xx=z;yy=i;}
}
g<<max<<' '<<xx<<' '<<yy<<'\n';
g.close();
return 0;
}