Pagini recente » Cod sursa (job #1780874) | Cod sursa (job #1288322) | Cod sursa (job #2426966) | Cod sursa (job #1475982) | Cod sursa (job #299189)
Cod sursa(job #299189)
#include<stdio.h>
#define MAXN 50010
#define Max(a, b) (a) > (b) ? (a) : (b)
int S[MAXN],n,k;
int main()
{
int i;
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%d%d",&n,&k);
for(i = 1; i <= n; i++) scanf("%d",&S[i]);
int bestSum = -int(2e9), min = 0, idx, beg, end;
for(i = 1; i <= n; i++)
{
S[i] += S[i - 1];
if (bestSum < S[i] - min && i-idx+1 >= k)
bestSum = S[i] - min, beg = idx + 1, end = i;
if (min > S[i])
min = S[i], idx = i;
}
printf("%d %d %d\n",beg,end,bestSum);
fclose(stdin); fclose(stdout);
return 0;
}