stl版
#include <iostream>
#include <cstring>
#include <stdio.h>
#include <queue>
using namespace std;
const int N = 1e6+10;
int n, k;
int a[N];
int main(int argc, const char * argv[]) {
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> a[i];
deque<int> dq;
for (int i = 0; i < n; i++) {
if (dq.size() && i-k+1 > dq.front()) dq.pop_front();
while (dq.size() && a[i] <= a[dq.back()]) dq.pop_back();
dq.push_back(i);
if (i >= k-1) cout << a[dq.front()] << " ";
}
cout << endl;
dq.clear();
for (int i = 0; i < n; i++) {
if (dq.size() && i-k+1 > dq.front()) dq.pop_front();
while (dq.size() && a[i] >= a[dq.back()]) dq.pop_back();
dq.push_back(i);
if (i >= k-1) cout << a[dq.front()] << " ";
}
cout << endl;
}