Pagini recente » Cod sursa (job #3135998) | Cod sursa (job #3342209) | Cod sursa (job #3315193) | Cod sursa (job #3342170) | Cod sursa (job #3332583)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n, k;
int a[50005];
int main()
{
int i, minim, smax, p, st, dr;
fin >> n >> k;
for(i = 1; i <= n; i++)
{
fin >> a[i];
a[i] += a[i - 1];
}
smax = a[k]; minim = p = 0;
st = 1; dr = k;
for(i = k + 1; i <= n; i++)
{
if(minim > a[i - k])
{
minim = a[i - k];
p = i - k;
}
if(smax < a[i] - minim)
{
smax = a[i] - minim;
st = p + 1; dr = i;
}
}
fout << st << " " << dr << " " << smax << '\n';
return 0;
}