Cod sursa(job #1367418)
Utilizator | Data | 1 martie 2015 20:54:50 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
# include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int i,j,n,m,s,x,ci,cs,I,J,maxx;
int main ()
{
f>>n;
s=-999999999; ci=1;
for (i=1; i<=n; ++i)
{
f>>x;
if (s+x>=x)
{
s=s+x;
++cs;
}
else
{
s=x;
ci=cs=i;
}
if (s>maxx) maxx=s, I=ci, J=cs;
}
g<<maxx<<" "<<I<<" "<<J<<"\n";
return 0;
}