Pagini recente » Cod sursa (job #3340548) | Cod sursa (job #657298) | Cod sursa (job #1467971) | Cod sursa (job #3326007) | Cod sursa (job #3320729)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
#define cin fin
#define cout fout
const int NMAX = 5e5 + 5;
int n, k, s, d;
int64_t v[NMAX];
deque<int> dq;
int min1[NMAX];
signed main(){
cin >> n >> k;
for (int i = 0; i < n; ++ i){
cin >> v[i];
}
for (int i = 0; i < k; ++ i){
while (!dq.empty() && v[dq.back()] > v[i]){
dq.pop_back();
}
dq.push_back(i);
}
min1[0] = v[dq.front()];
int max1 = min1[0];
s = 0;
d = k - 1;
for (int i = k; i < n; ++ i){
if (dq.front() <= i - k){
dq.pop_front();
}
while (!dq.empty() && v[dq.back()] > v[i]){
dq.pop_back();
}
dq.push_back(i);
min1[i - k + 1] = v[dq.front()];
if (max1 < min1[i - k + 1]){
max1 = min1[i - k + 1];
s = i - k + 1;
d = i;
}
}
cout << s + 1 << ' ' << d + 1 << ' ' << max1;
return 0;
}