Cod sursa(job #261695)
Utilizator | Gavrila Vlad GavrilaVlad | Data | 18 februarie 2009 18:12:21 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <stdio.h>
long n, i, j, k, s, b, st, sol, in, sf;
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
sol=-2000000000;
scanf("%ld\n", &n);
for(i=1; i<=n; i++)
{
scanf("%ld", &s);
if(s<=b+s)
{
b=b+s;
}
else
{
b=s;
st=i;
}
if(sol<b)
{
sol=b;
in=st;
sf=i;
}
}
printf("%ld %ld %ld\n", sol, in, sf);
return 0;
}