Pagini recente » Cod sursa (job #556855) | Cod sursa (job #2333373) | Cod sursa (job #2789794) | Cod sursa (job #458777) | Cod sursa (job #179194)
Cod sursa(job #179194)
#include <stdio.h>
#include <math.h>
long a[50005],b[50005],i,j,n,k,max=-200000000,x,y,q;
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]);b[i]=b[i-1]+a[i];}
/*for(q=n;q>=n-k;--q)*/
for(i=1;i<=n-k+1;i++)
for(j=i+k-1;j<=n-k;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;
}