Pagini recente » Cod sursa (job #396544) | Cod sursa (job #1680849) | Cod sursa (job #551372) | Cod sursa (job #137984) | Cod sursa (job #168740)
Cod sursa(job #168740)
#include <stdio.h>
long a[50005],b[50005],i,j,n,k,max=-200000000,x,y;
int main()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%ld %ld\n",&n,&k);
for(i=1;i<=n;i++)
scanf("%ld",&a[i]);
for(i=1;i<=n;i++)
b[i]=b[i-1]+a[i];
for(i=1;i<=n-k+1;i++)
for(j=i+k-1;j<=n;j++)
{
if(max<b[j]-b[i-1]){max=b[j]-b[i-1];x=i;y=j;}
}
printf("%ld %ld %ld",x,y,max);
return 0;
}