单调队列：
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<vector>
#include<cmath>
#include<string>
#include<map>
#include<queue>
using namespace std;
typedef long long ll;
int maxn[1000001],minn[1000001];
int maxans[1000001],minans[1000001];
int num[1000001];
//单调队列就是存储某种单调序列的下标，maxn[head]肯定是最大值的下标
int main(){
ll n,k;
scanf("%lld %lld",&n,&k);
int head1=0,head2=0,tail1=0,tail2=0;
for(int i=0;i<n;i++){
//先去掉超出区间左边界的下标
if(head1<tail1&&maxn[head1]<=i-k)head1++;
if(head2<tail2&&minn[head2]<=i-k)head2++;
scanf("%d",num+i);
//入单调递减队列
while(head1<tail1&&num[i]>num[maxn[tail1-1]])tail1--;
maxn[tail1++]=i;
//入单调递增队列
while(head2<tail2&&num[i]<num[minn[tail2-1]])tail2--;
minn[tail2++]=i;
//存储区间[i-k+1,i]的最大值
maxans[i]=num[maxn[head1]];
//存储区间[i-k+1,i]的最小值
minans[i]=num[minn[head2]];
}
//第一个区间肯定是[0,k-1]，所以i从k-1开始
for(int i=k-1;i<n-1;i++){
printf("%d ",minans[i]);
}
printf("%d\n",minans[n-1]);
for(int i=k-1;i<n-1;i++){
printf("%d ",maxans[i]);
}
printf("%d\n",maxans[n-1]);
return 0;
}
// /\ | / |**、
// / \ | / | \
// / \ |/ | / _____ ____ | /
// /------\ |\ |__/ / \ \ /\ / / \ | /
// / \ | \ | / \ \ / \ / /______\ |/
// / \ | \ | \ / \ / \ / \ |
// / \ | \ | \_____/ \/ \/ \_____ |
/**
* ┏┓ ┏┓
* ┏┛┗━━━━━━━┛┗━━━┓
* ┃ ┃
* ┃ ━ ┃
* ┃ ＞ ＜ ┃
* ┃ ┃
* ┃... ⌒ ... ┃
* ┃ ┃
* ┗━┓ ┏━┛
* ┃ ┃ Code is far away from bug with the animal protecting
* ┃ ┃ 神兽保佑,代码无bug
* ┃ ┃
* ┃ ┃
* ┃ ┃
* ┃ ┃
* ┃ ┗━━━┓
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛
*/
// warm heart, wagging tail,and a smile just for you!
//
// _ooOoo_
// o8888888o
// 88" . "88
// (| -_- |)
// O\ = /O
// ____/`---'\____
// .' \| |// `.
// / \||| : |||// \
// / _||||| -:- |||||- \
// | | \\ - /// | |
// | \_| ''\---/'' | |
// \ .-\__ `-` ___/-. /
// ___`. .' /--.--\ `. . __
// ."" '< `.___\_<|>_/___.' >'"".
// | | : `- \`.;`\ _ /`;.`/ - ` : | |
// \ \ `-. \_ __\ /__ _/ .-` / /
// ======`-.____`-.___\_____/___.-`____.-'======
// `=---='
// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
//
RMQ算法，超时。。
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<vector>
#include<cmath>
#include<string>
#include<map>
#include<queue>
using namespace std;
typedef int ll;
ll a[1000001];
ll maxn[1000001][20];
ll minn[1000001][20];
ll n;
void init(){
for(int i=1;i<=n;i++){
maxn[i][0]=minn[i][0]=a[i];
}
for(int j=1;(1<<j)<=n;j++){
for(int i=1;i+(1<<j)-1<=n;i++){
maxn[i][j]=max(maxn[i][j-1],maxn[i+(1<<(j-1))][j-1]);
minn[i][j]=min(minn[i][j-1],minn[i+(1<<(j-1))][j-1]);
}
}
}
int main(){
ll k,x,y;
scanf("%d %d",&n,&k);
for(int i=1;i<=n;i++){
scanf("%d",a+i);
}
init();
ll t=(ll)(log((double)k)/log((double)2));
for(int i=1;i+k-1<n;i++){
x=i;y=i+k-1;
printf("%d ",min(minn[x][t],minn[y-(1<<t)+1][t]));
}
printf("%d\n",min(minn[n+1-k][t],minn[n-(1<<t)+1][t]));
for(int i=1;i+k-1<n;i++){
x=i;y=i+k-1;
printf("%d ",max(maxn[x][t],maxn[y-(1<<t)+1][t]));
}
printf("%d\n",max(maxn[n+1-k][t],maxn[n-(1<<t)+1][t]));
return 0;
}