Pagini recente » Cod sursa (job #823991) | Cod sursa (job #2555016) | Cod sursa (job #473454) | Cod sursa (job #2674660) | Cod sursa (job #2641233)
#include <bits/stdc++.h>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int n, v[50001], sumamax = -2e9, inceput, helper = 1, sfarsit, k, sp[50001];
int main() {
in >> n >> k;
for (int i = 1; i <= n; ++i) {
in >> v[i];
sp[i] = sp[i - 1] + v[i];
}
int sum = sp[k-1];
for (int i = 1; i <= n; ++i) {
sum += v[i];
if (sp[i] - sp[i - k] > sum) {
helper = i - k + 1;
sum = sp[i] - sp[i - k];
}
if (sumamax < sum) {
sumamax = sum;
inceput = helper;
sfarsit = i;
}
}
out << inceput << " " << sfarsit << " " << sumamax;
return 0;
}