救救孩子，st表MLE掉了……

RT

#include<bits/stdc++.h>
using namespace std;
long long r,f,i,j;
char ch;
inline long long read() {
    r=0,f=1;
    ch=getchar();
    while(ch<'0'||ch>'9') {
        if(ch=='-') f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9') r=(r<<1)+(r<<3)+(ch^48),ch=getchar();
    return r*f;
}
long long a[1000005],maxx[1000005][20],minn[1000005][20],lg[1000005],n,m;
int main() {
    lg[0]=-1;
    n=read(),m=read();
    for(i=1;i<=n;++i) a[i]=read(),lg[i]=lg[i/2]+1;
    for(i=1;i<=n;++i) maxx[i][0]=a[i],minn[i][0]=a[i];
    for(i=1;i<=lg[n];++i) 
        for(j=1;j+(1<<i)-1<=n;++j) maxx[j][i]=max(maxx[j][i-1],maxx[j+(1<<(i-1))][i-1]),minn[j][i]=min(minn[j][i-1],minn[j+(1<<(i-1))][i-1]);
    for(i=1;i<=n-m+1;++i) printf("%d ",min(minn[i][lg[m]],minn[m+i-(1<<lg[m])][lg[m]]));
    puts("");
    for(i=1;i<=n-m+1;++i) printf("%d ",max(maxx[i][lg[m]],maxx[m+i-(1<<lg[m])][lg[m]]));
}