Cod sursa(job #1737605)
Utilizator | Data | 4 august 2016 14:50:33 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <cstdio>
long long n,s,smax=-9999999,i,x,p,u,P,U;
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%llu", &n);
p=1;
for (i=1; i<=n; ++i)
{
scanf("%llu", &x);
if (s+x<x)
{
s=x, p=u=i;
}
else
{
s=s+x,u++;
}
if (s>smax)
{
smax=s, P=p, U=u;
}
}
printf("%llu %llu %llu",smax,P,U);
return 0;
}