Pagini recente » Cod sursa (job #3316239) | Cod sursa (job #3354886) | Cod sursa (job #3322501) | Cod sursa (job #3354887) | Cod sursa (job #3315166)
#include <fstream>
using namespace std;
#define int long long
ifstream cin("secv2.in");
ofstream cout("secv2.out");
const int NMAX = 1e6;
int n, k, sum, l, r, answer;
int a[NMAX + 1];
pair<int, int> mini[NMAX + 1];
signed main() {
cin >> n >> k;
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
mini[0] = {0, 0};
for(int i = 1; i <= n; i++) {
sum += a[i];
if(i >= k) {
if(sum - mini[i - k].first > answer) {
answer = sum - mini[i - k].first;
l = mini[i - k].second + 1;
r = i;
}
}
mini[i] = min(mini[i - 1], {sum, i});
}
cout << l << ' ' << r << ' ' << answer << '\n';
return 0;
}