POJ2823 Sliding Window（单调队列）

Mr.Gzj

于 2019-04-24 15:04:42 发布

阅读量131

点赞数

分类专栏：单调队列、单调栈

本文链接：https://blog.csdn.net/Endeavor_G/article/details/89493433

版权

单调队列、单调栈专栏收录该内容

0 篇文章 0 订阅

订阅专栏

思路：stl的双端队列来模拟单调队列

#include <iostream>
#include <cstdio>
#include <deque>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
const int MAXN = 1e6 + 10;
int a[MAXN], b[MAXN], c[MAXN], n, k;
deque<int> deq;
int main() {
    cin >> n >> k;
    for(int i = 0; i < n; i++)
        scanf("%d", a + i);
    for(int i = 0; i < n; i++) {
        while(!deq.empty() && a[deq.back()] >= a[i])
            deq.pop_back();
        deq.push_back(i);
        if(i - k + 1 >= 0) {
            b[i - k + 1] = a[deq.front()];
            if(deq.front() == i - k + 1)
                deq.pop_front();
        }
    }
    deq.clear();
    for(int i = 0; i < n; i++) {
        while(!deq.empty() && a[deq.back()] <= a[i])
            deq.pop_back();
        deq.push_back(i);
        if(i - k + 1 >= 0) {
            c[i - k + 1] = a[deq.front()];
            if(deq.front() == i - k + 1)
                deq.pop_front();
        }
    }
    for(int i = 0; i < n - k + 1; i++)
        printf("%d%c", b[i], i == n - k ? '\n' : ' ');
    for(int i = 0; i < n - k + 1; i++)
        printf("%d%c", c[i], i == n - k ? '\n' : ' ');
    return 0;
}