Cod sursa(job #2936973)
Utilizator | Data | 9 noiembrie 2022 18:28:58 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | cnilc1_2-dq | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
long long n, k, i, m = -999999, u;
int a[500002];
deque<int> q;
int main() {
cin >> n >> k;
for(i = 1; i <= n; i++) cin >> a[i];
for(i = 1; i <= n; i++) {
while(!q.empty() && a[i] <= a[q.back()]) q.pop_back();
q.push_back(i);
if(i >= k) {
if(!q.empty() && i - q.front() >= k) q.pop_front();
if(m < a[q.front()]) {
u = i;
m = a[q.front()];
}
}
}
cout << u - k + 1 << " " << u << " " << m;
return 0;
}