简单

#include<bits/stdc++.h>
using namespace std;
const int maxn=2e6+10;
int a[maxn];
deque<int>q;
int main(){
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    printf("0\n");
    for(int i=2;i<=n;i++){
        while(!q.empty() && a[q.back()] > a[i-1]){
            q.pop_back();
        }
        q.push_back(i-1);
        while(!q.empty() && q.front() < i-m){
            q.pop_front();
        }
        printf("%d\n",a[q.front()]);
    }
    return 0;
}