Pagini recente » Cod sursa (job #2864071) | Cod sursa (job #1731871) | Cod sursa (job #981548) | Cod sursa (job #1029488) | Cod sursa (job #40643)
Cod sursa(job #40643)
#include <stdio.h>
#define NMAX 50001
#define MIN -(1<<16)
int x[NMAX], n, k, max,beg,end;
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, r;
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;
}
}
void afisare()
{
printf("%d %d %d\n", beg, end, max);
}
int main()
{
freopen("secv2.in", "r", stdin);
freopen("secv2.out", "w", stdout);
read();
rezolv();
afisare();
return 0;
}