Cod sursa(job #263212)
Utilizator | Data | 19 februarie 2009 23:46:45 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <stdio.h>
long n,p,u,s,smax,i,x,p1,u1;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%ld", &n);
scanf("%ld", &x);
s=x; smax=x; p=1; u=1;
for (i=2;i<=n;i++)
{
scanf("%ld", &x);
if (s+x<x)
{
s=x;
p=u=i;
}
else {
s+=x;
u++;
}
if (s>smax)
{
smax=s;
p1=p;
u1=u;
}
}
printf("%ld %ld %ld", smax, p1, u1);
return 0;
}