Pagini recente » Cod sursa (job #529158) | Cod sursa (job #1048505) | Cod sursa (job #817454) | Cod sursa (job #2873735) | Cod sursa (job #1900823)
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e4;
int v[MAXN + 1];
int main()
{
int n, k, pmin, maxc, maxl, maxr;
ifstream fin("secv2.in");
fin >> n >> k;
for (int i = 1; i <= n; ++i) {
fin >> v[i];
v[i] += v[i - 1];
}
fin.close();
pmin = 0; maxc = -2e9;
for (int i = k; i <= n; ++i) {
if (v[pmin] > v[i - k])
pmin = i - k;
if (maxc < v[i] - v[pmin]) {
maxc = v[i] - v[pmin];
maxl = pmin + 1;
maxr = i;
}
}
ofstream fout("secv2.out");
fout << maxl << " " << maxr << " " << maxc << '\n';
fout.close();
return 0;
}