Pagini recente » Cod sursa (job #2999437) | Cod sursa (job #803983) | Cod sursa (job #219151) | Cod sursa (job #675621) | Cod sursa (job #2038190)
#include <cstdio>
#define N 50010
using namespace std;
int s[N], a[N], n, k, maxim, pmax, pmin;
int main()
{
freopen("secv2.in", "r", stdin);
freopen("secv2.out", "w", stdout);
scanf("%d %d\n", &n, &k);
for(int i=1;i<=n;i++)
{
scanf("%d ", &a[i]);
s[i]=s[i-1]+a[i];
}
maxim=s[k];
pmax=k; pmin=0;
for(int i=k+1;i<=n;i++)
{
if(maxim<s[i]-s[pmin])
{
maxim=s[i]-s[pmin];
pmax=i;
}
if(maxim<s[pmax]-s[i-k-1])
{
maxim=s[pmax]-s[i-k-1];
pmin=i-k-1;
}
}
printf("%d %d %d", pmin+1, pmax, maxim);
return 0;
}