Pagini recente » Cod sursa (job #1016590) | Cod sursa (job #1113893) | Cod sursa (job #2382057) | Cod sursa (job #1073363) | Cod sursa (job #2010603)
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <ctime>
#include <deque>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define pb push_back
const int NMax = 5e5 + 5;
const int inf = 1e9 + 5;
int N,K;
int v[NMax];
deque<int> deq;
int main() {
in>>N>>K;
for (int i=1;i < K;++i) {
in>>v[i];
while (deq.size() && v[deq.back()] >= v[i]) {
deq.pop_back();
}
deq.push_back(i);
}
int mx = -inf,st = -1,dr = -1;
for (int i=K;i <= N;++i) {
in>>v[i];
if (deq.front() == i-K) {
deq.pop_front();
}
while (deq.size() && v[deq.back()] >= v[i]) {
deq.pop_back();
}
deq.push_back(i);
if (v[deq.front()] > mx) {
mx = v[deq.front()];
st = i-K+1;
dr = i;
}
}
out<<st<<' '<<dr<<' '<<mx<<'\n';
return 0;
}