只能A一个点

用的手写双端队列（不知道对不对）

#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<algorithm>
#define MAXN 1000001
#define rr register
using namespace std;
int n,k,a[MAXN],head=1,tail;
struct QwQ{
    int w,num;
}dq[MAXN];
inline void push_back(int x){dq[++tail].w=x;}
inline bool pop_front(){if(head<=tail)head++;return head<=tail;}
inline bool pop_back(){if(head<=tail)tail--;return head<=tail;}
inline int back(){return dq[tail].w;}
inline int front(){return dq[head].w;}
inline bool empty(){return head<=tail;}

inline int read(){
    int x=0;bool f=0;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=!f;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
    return f?-x:x;
}

int main(){
    freopen("testdata (1).in","r",stdin);
    freopen("qwq.out","w",stdout);
    n=read(),k=read();
    for(rr int i=1;i<=n;++i){
        a[i]=read();
    }
    dq[0].w=-0x7fffffff;
    for(rr int i=1;i<=n;++i){
        if(a[i]>back()){
            push_back(a[i]);
            dq[tail].num=i;
        }
        else{
            while(a[i]<back()){
                if(pop_back()==0) break;
            }
            push_back(a[i]);
            dq[tail].num=i;
        }
        if(i>3&&dq[tail].num-dq[head].num>=3) pop_front();
        if(i>=k) printf("%d ",front());
    }
    puts("");
    head=1,tail=0;
    dq[0].w=0x7fffffff;
    for(rr int i=1;i<=n;++i){
        if(a[i]<back()){
            push_back(a[i]);
            dq[tail].num=i;
        }
        else{
            while(a[i]>back()){
                if(pop_back()==0) break;
            }
            push_back(a[i]);
            dq[tail].num=i;
        }
        if(i>3&&dq[tail].num-dq[head].num>=3) pop_front();
        if(i>=k) printf("%d ",front());
    }
    return 0;
}