70分求优化，3T

#include<iostream>
using namespace std;

struct min_sdqueue{
    int tail, front;
    int z[2000001],p[2000001];
    min_sdqueue(){
        tail = 0, front = 1;
    }
    void push(int x, int y){
        while(tail >= front && x < z[tail])
          tail--;
        tail++;
        z[tail] = x;
        p[tail] = y;
    }
    int top(){
        return z[front];
    }
    int read(){
        return p[front];
    }
    void move(){
        front++;
    }
};

int n, m;
int a[2000001];
int ai;
int main(){
    min_sdqueue que;
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        cin >> ai;
        if(i == 1){
            cout << 0 << endl;
            que.push(ai, i);
            continue;
        }
        while(que.read() <= i - m - 1)
          que.move();
        cout << que.top() << endl;
        que.push(ai, i);
    }
    return 0;
}