Pagini recente » Statistici M Eugenio (eugenio169) | Cod sursa (job #2962671) | Cod sursa (job #2780929) | Infoarena Monthly 2014 - Solutii Runda 7 | Cod sursa (job #1784134)
#include<cstdio>
int v[50001];
int main()
{
int n,k,j,min,max,st,dr,ci,a,i;
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%d%d",&n,&k);
for(i=1;i<=k;i++)
{
scanf("%d",&a);
v[i]=v[i-1]+a;
}
min=1250000001;
max=-1250000001;
for(j=k+1;j<=n;j++)
{
scanf("%d",&a);
i=j-k;
v[j]=v[j-1]+a;
if(v[i]<min)
{
min=v[i];
ci=i;
}
if(v[j]-min>max)
{
max=v[j]-min;
st=ci+1;
dr=i+k;
}
}
if(n==k)
printf("1 %d %d\n",n,v[n]);
else
printf("%d %d %d\n",st,dr,max);
return 0;
}