Pagini recente » Cod sursa (job #3230205) | Cod sursa (job #3189831) | Cod sursa (job #1919122) | Cod sursa (job #2950515) | Cod sursa (job #47813)
Cod sursa(job #47813)
#include <stdio.h>
#define NMAX 50001
int n, k, x[NMAX], max, end, b;
void read()
{
int i;
scanf("%d%d", &n, &k);
for (i = 1; i <= n; i++)
scanf("%d", &x[i]), x[i]+=x[i-1];
}
void rezolv()
{
int i, j, m,s;
max = x[k], b = 0, end = k;
for (i = k+1; i <= n; i++)
{ m=i-k;
for (j = b; j <= m; j++)
{ s = x[i]-x[j];
if (s > max)
max = s, b = j, end = i;
}
}
}
int main()
{
freopen("secv2.in", "r", stdin);
freopen("secv2.out", "w", stdout);
read();
rezolv();
printf("%d %d %d\n", b+1, end, max);
return 0;
}