Pagini recente » Cod sursa (job #3222897) | Cod sursa (job #1461847) | Cod sursa (job #2915034) | Cod sursa (job #1453842) | Cod sursa (job #1032659)
#include<stdio.h>
#include<algorithm>
#define maxn 50005
#define inf 0x3f3f3f3f
using namespace std;
int n,m,sol=-inf,L,R,pos;
int s[maxn];
void read()
{
int x;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
scanf("%d",&x);
s[i]=s[i-1]+x;
}
int Min=inf;
for(int i=m;i<=n;i++)
{
if(Min>s[i-m]) Min=s[i-m],pos=i-m;
if(s[i]-Min>sol)
sol=s[i]-Min,L=pos+1,R=i;
}
}
int main()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
read();
printf("%d %d %d",L,R,sol);
fclose(stdin);
fclose(stdout);
return 0;
}