Pagini recente » Cod sursa (job #2079838) | Cod sursa (job #263745) | Cod sursa (job #732050) | Cod sursa (job #2396912) | Cod sursa (job #263390)
Cod sursa(job #263390)
#include<stdio.h>
#define Nmax 50020
int N,K,v[Nmax],s[Nmax];
void read()
{
int i;
for(i=1;i<=N;++i)
{
scanf("%d",&v[i]);
s[i]=s[i-1]+v[i];
}
}
void solve()
{
int i,min=2000000,inceput=0,sf=0,max=-250000;
for(int i=1;i<=N;++i)
if(min>v[i])
{
min=v[i];
inceput=i;
sf=inceput+K;
}
while(K<=N)
{
for(int i=inceput;K+i-1<=N;++i)
if(s[K+i-1]-s[i-1]>max)
{
max=s[K+i-1]-s[i-1];
inceput=i;
sf=K+i-1;
}
++K;
}
if(max==-250000)
max=0;
printf("%d %d %d\n",inceput,sf,max);
}
int main()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%d%d",&N,&K);
read();
solve();
return 0;
}