蓝桥杯之每日一题

解题思路
利用STL的双端队列实现单调队列

---

解题代码

#include <iostream>
#include <cstdio>
#include <deque>

using namespace std;
const int N = 1e6 + 10;
int n, k;
struct num{
    int order, val;
    num(int order = 0, int val = 0): order(order), val(val){};
};
deque<num> que1;
deque<num> que2;

int maxx[N], cnt = 0;
int main() {
    cin >> n >> k;
    num temp;
    for (int i = 1; i <= n; ++i) {
        temp.order = i;
        cin >> temp.val;
        while (!que1.empty() && temp.val >= que1.back().val)
            que1.pop_back();
        while (!que2.empty() && temp.val <= que2.back().val)
            que2.pop_back();

        que1.push_back(temp);
        que2.push_back(temp);

        while (!que1.empty() && i - que1.front().order >= k)
            que1.pop_front();
        while (!que2.empty() && i - que2.front().order >= k)
            que2.pop_front();

        if (i >= k){ 
            cout << que2.front().val;
            maxx[++cnt] = que1.front().val;
        }
    }

    printf("\n");
    for (int i = 1; i <= cnt; ++i) {
        cout << maxx[i];
    }
    return 0;
}