Pagini recente » Cod sursa (job #492860) | Cod sursa (job #1794226) | Cod sursa (job #2548948) | Cod sursa (job #1993949) | Cod sursa (job #180565)
Cod sursa(job #180565)
#include<stdio.h>
#define M 51000
long long a[M],max=-2000000000;
long inc,sf,n,k,i,j;
int main()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%ld %ld ",&n,&k);
for (i=1;i<=n;i++)
{
scanf("%lld",&a[i]);a[i]+=a[i-1];
}
for (i=1;i<=n-k+1;i++)
for(j=i+k-1;j<=n;j++)
if (a[j]-a[i-1]>max)
{
max=a[j]-a[i-1];
inc=i;sf=j;
}
printf("%ld %ld %lld\n",inc,sf,max);
return 0;
}