Pagini recente » Cod sursa (job #2478628) | Cod sursa (job #2418932) | Cod sursa (job #812049) | Cod sursa (job #1563609) | Cod sursa (job #2217752)
#include <bits/stdc++.h>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
int main() {
ios::sync_with_stdio(false); in.tie(0); out.tie(0);
int n, k; in >> n >> k;
vector< int > v(n + 1);
for(int i = 1; i <= n; ++i) {
in >> v[i];
}
deque< int > dq;
int bazaMaxima = INT_MIN, left = -1, right = -1;
for(int i = 1; i <= n; ++i) {
while(!dq.empty() && v[i] <= v[dq.back()]) {
dq.pop_back();
}
dq.push_back(i);
if(i - dq.front() >= k) {
dq.pop_front();
}
if(i >= k) {
if(v[dq.front()] > bazaMaxima) {
bazaMaxima = v[dq.front()];
left = i - k + 1;
right = i;
}
}
}
cout << left << " " << right << " " << bazaMaxima << "\n";
return 0;
}