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