Pagini recente » Cod sursa (job #2232564) | Cod sursa (job #1346977) | Cod sursa (job #3147337) | Cod sursa (job #280843) | Cod sursa (job #921685)
Cod sursa(job #921685)
#include<cstdio>
using namespace std;
const int DMAX=50005;
int s[DMAX];
int main()
{
freopen("secv2.in","r",stdin);freopen("secv2.out","w",stdout);
int a,n,k,i,best=-2e9,j,l,b,e;
scanf("%d%d",&n,&k);
for(i=1;i<=n;++i)
scanf("%d",&a),s[i]=s[i-1]+a;
for(i=1;i<=n-k+1;++i)
for(j=i+k-1;j<=n;++j)
if(s[j]-s[i]>best)
best=s[j]-s[i],b=i,e=j;
printf("%d %d %d",b,e,best);
}