RE...

rt

#include <bits/stdc++.h>

using namespace std;

/**
* Code by mTx
* time: 2018/4/25
*/
#define f first
#define s second
#define m make_pair
deque<pair<int, int> > lty;
int val[1000010];

int main() {
    int n, k;
    scanf("%d%d", &n, &k);
    for(int i = 1; i <= n; i++)
        scanf("%d", &val[i]);
    printf("0\n%d\n", val[1]);
    lty.push_back(m(val[1], 1));
    for(int i = 2; i < n; i++) {
        if (lty.empty()) {
            lty.push_back(m(val[i], i));
            printf("%d\n", lty.front().f);
            continue;
        }
        while (lty.size() && lty.back().f >= val[i]) {
            lty.pop_back();
        }
        lty.push_back(m(val[i], i));
        while (lty.front().s <= i - k)
            lty.pop_front();
        printf("%d\n", lty.front().f);
    }
    putchar('\n');
    return 0;
}

RE两个点