Pagini recente » Cod sursa (job #2977295) | Cod sursa (job #2407997) | Cod sursa (job #2525817) | Cod sursa (job #820726) | Cod sursa (job #2801234)
#include <bits/stdc++.h>
using namespace std;
int main() {
ifstream fin("secv2.in");
ofstream fout("secv2.out");
fin.tie(0);
std::ios_base::sync_with_stdio(0);
const int MAX_N = 50000;
int n, k, partialSums[MAX_N], v[MAX_N];
fin >> n >> k >> v[0];
partialSums[0] = v[0];
for (int i = 1; i < n; ++i) {
fin >> v[i];
partialSums[i] = partialSums[i - 1] + v[i];
}
int ans = partialSums[n - 1], start = 1, finish = n;
for (int i = k - 1; i < n; ++i) {
int *minim = min_element(partialSums, partialSums + i - k + 1);
if (v + i + 1 - minim >= k && ans < partialSums[i] - *minim) {
ans = partialSums[i] - *minim;
start = minim - partialSums + 1;
finish = i + 1;
}
}
fout << start << ' ' << finish << ' ' << ans;
}