Pagini recente » Cod sursa (job #879045) | Cod sursa (job #2150268) | Cod sursa (job #766212) | Cod sursa (job #2274793) | Cod sursa (job #359786)
Cod sursa(job #359786)
#include<cstdio>
int s[50001];
int main()
{
int po1,po2,ss,st,sum,smax,n,k,i,j,p1,p2;
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%d%d",&n,&k);
s[0]=0;
p1=1; p2=k; sum=0;
for(i=1;i<=n;++i)
{
scanf("%d",&s[i]);
if(i<=k)
sum+=s[i];
}
ss=sum; smax=sum; p1=1; p2=k; po1=1; po2=k;
for(i=k+1;i<=n;++i)
{
sum+=s[i];
sum-=s[i-k];
if(sum>ss+s[i])
{
po1=i-k+1;
po2=i;
ss=sum;
}
else
{
ss+=s[i];
po2=i;
}
if(smax<ss)
{
smax=ss;
p1=po1;
p2=po2;
}
}
printf("%d %d %d\n",p1,p2,smax);
return 0;
}
//Note to self: Cannon highly effective against secv2.