Cod sursa(job #629822)
Utilizator | Sebastian Claici sebii_c | Data | 4 noiembrie 2011 00:35:29 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 70 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <stdio.h>
#define INF 0x3f3f3f3f
inline int max(int a, int b)
{
return (a>b)?a:b;
}
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
int n, best = 0, i, beg, end, maxim = -INF, idx, x;
scanf("%d", &n);
for (i=1; i<=n; ++i) {
scanf("%d", &x);
if (best < 0)
best = x, idx = i;
else
best += x;
if (best > maxim) {
maxim = best;
beg = idx;
end = i;
}
}
printf("%d %d %d\n", maxim, beg, end);
return 0;
}