POJ2823 Sliding Window单调队列

题目链接

题目大意

给定一个长度最大为100w的序列，求这个序列中每三个相邻元素的最大值，从左到右输出。

解题思路

很多同学说是线段树，的确线段树能解，但是对于这种比较有序的查找，单调队列的选择更好……实际上这道题就是单调队列的入门题……

CODE

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxn = (int)1e6+10;
int mn[maxn], mx[maxn], a[maxn], n, k;
void get_max(){
    int st = 1, ed = 1;
    for (int i = 1; i < k; i++){
        while(a[mx[ed]] < a[i] && ed >= st) ed -= 1;
        ed += 1; mx[ed] = i;
    }
    for (int i = k; i <= n ; i++){
        while (mx[st] <= i-k && st <= ed) st += 1;
        while(a[mx[ed]] < a[i] && ed >= st) ed -= 1;
        ed += 1; mx[ed] = i;
        if (i != n) printf("%d ", a[mx[st]]);
    }
    printf("%d\n", a[mx[st]]);
}
void get_min(){
    int st = 1, ed = 1;
    for (int i = 1; i < k; i++){
        while(a[mn[ed]] > a[i] && st <= ed) ed -= 1;
        ed += 1; mn[ed] = i;
    }
    for (int i = k; i <= n; i++){
        while(mn[st] <= i-k && st <= ed) st += 1;
        while(a[mn[ed]] > a[i] && st <= ed) ed -= 1;
        ed += 1; mn[ed] = i;
        if (i != n) printf("%d ", a[mn[st]]);
    }
    printf("%d\n", a[mn[st]]);
}
void solve(){
    for (int i = 1; i <= n; i++) scanf("%d", a+i);
    get_min(); get_max();
}
int main(){
    while(scanf("%d%d", &n, &k) == 2) solve();
    return 0;
}