Sliding Window（单调队列）

链接：https://ac.nowcoder.com/acm/problem/51001
来源：牛客网

题目描述
An array of size n ≤ 106 is given to you. There is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves rightwards by one position. Following is an example:
The array is [1 3 -1 -3 5 3 6 7], and k is 3.
Window position Minimum value Maximum value
[1 3 -1] -3 5 3 6 7 -1 3
1 [3 -1 -3] 5 3 6 7 -3 3
1 3 [-1 -3 5] 3 6 7 -3 5
1 3 -1 [-3 5 3] 6 7 -3 5
1 3 -1 -3 [5 3 6] 7 3 6
1 3 -1 -3 5 [3 6 7] 3 7
Your task is to determine the maximum and minimum values in the sliding window at each position.

输入描述:
The input consists of two lines. The first line contains two integers n and k which are the lengths of the array and the sliding window. There are n integers in the second line.
输出描述:
There are two lines in the output. The first line gives the minimum values in the window at each position, from left to right, respectively. The second line gives the maximum values.
示例1
输入
复制
8 3
1 3 -1 -3 5 3 6 7
输出
复制
-1 -3 -3 -3 3 3
3 3 5 5 6 7

题意：在每个长度为k的区间内找到最小值和最大值。

题记：用优先队列存下每个数的值和位置，每次从队头取元素，如果该元素位置不在区间范围内则不要，直到找到一个在区间内的值即最大或最小值。

#include<bits/stdc++.h>

using namespace std;
const int N=1e6+10;
int a[N];

struct Node{
    int x,w;
    bool operator < (const Node &W)const{
        return x<W.x;
    }
    bool operator > (const Node &W)const{
        return x>W.x;
    }
}node[N];

priority_queue<Node,vector<Node>,less<Node>>q1;//大顶堆
priority_queue<Node,vector<Node>,greater<Node>>q2;//小顶堆

int main(){
    int n,k;
    cin>>n>>k;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    for(int i=1;i<k;i++){
        q1.push({a[i],i});
        q2.push({a[i],i});
    }
    for(int i=k;i<=n;i++){
        q2.push({a[i],i});
        auto s=q2.top();
        while(s.w<=i-k){
            q2.pop();
            s=q2.top();
        }
        if(i!=n) cout<<s.x<<' ';
        else cout<<s.x<<endl;
    }
    for(int i=k;i<=n;i++){
        q1.push({a[i],i});
        auto s=q1.top();
        while(s.w<=i-k){
            q1.pop();
            s=q1.top();
        }
        if(i!=n)cout<<s.x<<' ';
        else cout<<s.x<<endl;
    }
    return 0;
}