Pagini recente » Cod sursa (job #2064984) | Cod sursa (job #151517) | Cod sursa (job #2274230) | Cod sursa (job #3158009) | Cod sursa (job #1277198)
#include <cstdio>
using namespace std;
int max1,min1,m1,m2,i,j,k,n,m21,s[50001];
int main()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%d%d",&n,&k);
max1=(-25000)*k;
min1=0;
m1=0;
m2=0;
for(i=1;i<=n;i++)
{
scanf("%d",&s[i]);
s[i]=s[i]+s[i-1];
if(i>k)
if(s[i-k]<min1)
{
min1=s[i-k];
m2=i-k;
}
if(i>=k)
if(s[i]-min1>max1)
{
max1=s[i]-min1;
m1=i;
m21=m2;
}
}
printf("%d %d %d",m21+1,m1,max1);
return 0;
}