Cod sursa(job #47821)
Utilizator | Filip Sanziana Zuzi | Data | 4 aprilie 2007 00:22:40 |
---|---|---|---|
Problema | Secventa 2 | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <stdio.h>
#define NMAX 50001
int main()
{
freopen("secv2.in", "r", stdin);
freopen("secv2.out", "w", stdout);
int n, k, x[NMAX], max, beg, end, b;
int i, j, s;
scanf("%d%d", &n, &k);
for (i = 1; i <= n; i++)
scanf("%d", &x[i]), x[i]+=x[i-1];
max = x[k], b =beg = 0, end = k;
for (i = k+1; i <= n; i++)
{ for (j = i-k; j >= beg; j--)
{ s = x[i]-x[j];
if (s > max)
max = s, b = j, end = i;
}
beg=b;
}
printf("%d %d %d\n", b+1, end, max);
return 0;
}