Cod sursa(job #226864)
#include<fstream.h>
#define N 51
#define INF 2000000000
long i,j,st,dr,poz[N],v[N],sum1[N],sum2[N],max,n,k;
int main()
{ ifstream fin("secv2.in");
ofstream fout("secv2.out");
fin>>n>>k;st=1;dr=n;
for(i=1;i<=n;i++)
fin>>v[i];
max=-INF;
for(i=1;i<=k;i++)sum1[i]=sum1[i-1]+v[i];
for(i=k;i<=n;i++)
{ sum1[i]=sum1[i-1]+v[i];
if(sum1[i]>max)
max=sum1[i],dr=i;
}
for(i=dr;i>=dr-k;i--)sum2[i]=sum2[i+1]+v[i];
for(i=dr-k-1;i>=1;i--)
{ sum2[i]=sum2[i+1]+v[i];
if(sum2[i]>max)
max=sum2[i],st=i;
}
fout<<st<<' '<<dr<<' '<<max;
return 0;
}