存一下单调队列模版

最新推荐文章于 2024-04-15 11:42:37 发布

卡常带师

最新推荐文章于 2024-04-15 11:42:37 发布

阅读量116

点赞数

分类专栏：数据结构

本文链接：https://blog.csdn.net/Zenith_Habitant/article/details/106144970

版权

数据结构专栏收录该内容

52 篇文章 1 订阅

订阅专栏

#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define p_queue priority_queue
#define pb push_back

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
const ll INF = 1e18;
int n , k;
int a[1000005];
int q[1000005];
int main(void)
{

    cin >> n >> k;
    for (int i = 1 ; i <= n ; i ++)
        cin >> a[i];
    int hh = -1 , tt = 0;

    for (int i = 1 ; i <= n ; i ++)
    {
        while(hh <= tt && q[hh] < i - k + 1) hh ++;
        while (hh <= tt && a[q[tt]] >= a[i]) tt --;
        q[++ tt] = i;
        if(i - k >= 0) cout << a[q[hh]] << ' ';
    }
    cout << endl;
    hh = -1 , tt = 0;

    for (int i = 1 ; i <= n ; i ++)
    {
        while(hh <= tt && q[hh] < i - k + 1) hh ++;
        while (hh <= tt && a[q[tt]] <= a[i]) tt --;
        q[++ tt] = i;
        if(i - k >= 0) cout << a[q[hh]] << ' ';
    }
    cout << endl;


}