Cod sursa(job #40741)
Utilizator | Filip Sanziana Zuzi | Data | 27 martie 2007 18:19:57 |
---|---|---|---|
Problema | Secventa 2 | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <stdio.h>
#define NMAX 50001
#define MIN -1250000001
int main()
{
freopen("secv2.in", "r", stdin);
freopen("secv2.out", "w", stdout);
int x[NMAX], n, k, max, beg, end;
int i, j, r;
scanf("%d %d", &n, &k);
for (i = 1; i <= n; i++)
scanf("%d", &x[i]), x[i] += x[i-1];
max = MIN;
for (i = k; i <= n; i++)
for (j = i - k; j >= 0; j--)
{
r = x[i] - x[j];
if ( r > max )
max = r, beg = j + 1, end = i;
}
printf("%d %d %d\n", beg, end, max);
return 0;
}