Pagini recente » Cod sursa (job #2433484) | Cod sursa (job #1074087) | Statistici grab ruben (grabruben) | Cod sursa (job #1680898) | Cod sursa (job #1171372)
#include<fstream>
#include<cstdio>
using namespace std;
int i,n,k,j,v[50005],p[50005],be,en,s1,e;
long long m;
int main()
{
freopen("secv2.in", "r", stdin);
freopen("secv2.out", "w", stdout);
scanf("%d%d", &n, &k);
for (i=1; i<=n; i++)
{
scanf("%d", &v[i]);
p[i]=p[i-1]+v[i];
}
m=-9000000000000;
for (i=1; i<=n-k+1; i++)
{
e=i+k-1;
s1=p[i+k-1]-p[i-1];
for (j=i+k; j<=n; j++)
{
if (p[j]-p[i-1]>s1)
{
s1=p[j]-p[i-1];
e=j;
}
}
if (s1>m)
{
m=s1;
be=i;
en=e;
}
}
printf("%d %d %d", be, en,m);
return 0;
}