Pagini recente » Cod sursa (job #2333524) | Cod sursa (job #3320497) | Cod sursa (job #1569936) | Cod sursa (job #3338061) | Cod sursa (job #3315122)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
vector<long long> sp(6000001);
int main() {
int n, k;
fin >> n >> k;
for (int i = 1; i <= n; i++) {
fin >> sp[i];
}
long long maxi = -9223372036854775807, ansi, ansj, mini = 0, j;
for (int i = 1; i <= n; i++) {
sp[i] += sp[i - 1];
if (maxi < sp[i] - mini && i - j >= k) {
maxi = sp[i] - mini;
ansj = j + 1;
ansi = i;
}if (mini > sp[i]) {
mini = sp[i];
j = i;
}
}
fout << ansj << " " << ansi << " " <<maxi << '\n' ;
return 0;
}