依旧单调队列

#include<bits/stdc++.h>
using namespace std;
int n,k,a[2000005];
int main(){
    cin>>n>>k;
    deque<int>q;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int i=1;i<=n;i++){
        while(q.size()&&a[q.back()]<a[i]){
            q.pop_back();
        }
        q.push_back(i);
        if(q.front()==i-k)q.pop_front();
        if(i-k>-1)cout<<a[q.front()]<<endl;
    }
    return 0;
}