Pagini recente » Cod sursa (job #856244) | Cod sursa (job #1031594) | Cod sursa (job #2972680) | Cod sursa (job #13082) | Cod sursa (job #1090332)
#include <cstdio>
#define Nmax 50005
using namespace std;
int v[Nmax],s[Nmax];
int n,i,k,x,y,poz,minim;
long long sum;
int main()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%d %d",&n,&k);
s[0]=0;
for(i=1;i<=n;++i)
{
scanf("%d",&v[i]);
s[i]=s[i-1]+v[i];
}
minim=s[1];
sum=-9999999999;
for(i=2;i<=n;++i)
{
if (s[i]-minim>sum && i-poz>=k)
{
sum=s[i]-minim;
y=i;x=poz+1;
//printf("%d %d %d\n",x,y,sum);
}
if (s[i]<minim)
{
minim=s[i];
poz=i;
}
}
printf("%d %d %d",x,y,sum);
return 0;
}