Cod sursa(job #1413885)
Utilizator | Data | 2 aprilie 2015 10:28:51 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <cstdio>
int n,i,st,dr,stmax,drmax,s,smax,x;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
st=1;
dr=1;
stmax=1;
drmax=1;
s=-2000000000;
smax=-2000000000;
scanf("%d",&n);
for (i=1; i<=n; i++)
{
scanf("%d",&x);
if (s+x>=x) { s=s+x; dr=i;}
else
{
s=x;
st=i;
}
if (s>smax)
{
smax=s;
stmax=st;
drmax=dr;
}
}
printf("%d %d %d\n",smax,stmax,drmax);
return 0;
}