Pagini recente » Cod sursa (job #3293781) | Cod sursa (job #234678) | Cod sursa (job #2864887) | Cod sursa (job #560798) | Cod sursa (job #262262)
Cod sursa(job #262262)
#include <stdio.h>
int v[50005],n,k;
int s[50005];
void read()
{
int i;
scanf("%d%d",&n,&k);
for (i=1; i<=n; i++)
{
scanf("%d",&v[i]);
s[i]=s[i-1]+v[i];
}
}
void solve()
{
int st,dr,part,i,j,min,stf,drf;
long long suma=0;
stf=1;
drf=n;
suma=s[k];
st=1;
dr=k;
min=26000;
i=k;
for (j=0; j<=i-k; j++)
{
if (s[j]<min)
{
min=s[j];
dr=i;
st=j+1;
}
}
part=s[i]-min;
if (part>suma)
{
suma=part;
stf=st;
drf=dr;
}
for (i=k+1; i<=n; i++)
{
min=26000;
if (s[i-k]<min)
{
min=s[i-k];
dr=i;
st=i-k+1;
}
else
dr=i;
/*for (j=0; j<=i-k; j++)
{
if (s[j]<min)
{
min=s[j];
dr=i;
st=j+1;
}
}*/
part=s[i]-min;
if (part>suma)
{
suma=part;
stf=st;
drf=dr;
}
}
printf("%d %d %lld",stf,drf,suma);
}
int main()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
read();
solve();
return 0;
}