Cod sursa(job #492418)
Utilizator | Data | 14 octombrie 2010 15:25:17 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <stdio.h>
using namespace std;
int s[6000005],n,i,sum=-int(2e9),min,x,st,dr;
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%d", &n);
for (i=1;i<=n;++i)
scanf("%d", &s[i]);
for (i=1;i<=n;++i)
{
s[i]=s[i]+s[i-1];
if (sum<s[i]-min)
sum=s[i]-min, st=x+1, dr=i;
if (min>s[i])
min=s[i], x=i;
}
printf("%d %d %d", sum, st, dr);
return 0;
}