- 单调队列:一般用来在一个动态小区间中寻找极值位置。
- 单调栈:求每个位置左边,离他最近且小于/大于他的数的位置
单调队列头尾均能出队列,只能在队尾入队列 头出尾进,由此对应滑动窗口类题目- 双端队列deque可用于构建单调队列,其功能更多。
#include <iostream>
#include <vector>
using namespace std;
const int N = 1e6 + 10;
vector<int> nums(N);
vector<int> index_dequeue(N);
int main()
{
int n, k;
cin >> n >> k;
for(int i = 0; i < n; ++i)
cin >> nums[i];
int head = 0, tail = 0;
for(int i = 0; i < n; ++i)
{
if(i - index_dequeue[head] + 1 > k) head++;
while(head < tail && nums[index_dequeue[tail - 1]] >= nums[i])
tail--;
index_dequeue[tail++] = i;
if(index_dequeue[tail - 1] >= k - 1)
cout << nums[index_dequeue[head]] << " ";
}
cout << endl;
head = tail = 0;
for(int i = 0; i < n; ++i)
{
if(i - index_dequeue[head] + 1 > k) head++;
while(head < tail && nums[index_dequeue[tail - 1]] <= nums[i])
tail--;
index_dequeue[tail++] = i;
if(index_dequeue[tail - 1] >= k - 1)
cout << nums[index_dequeue[head]] << " ";
}
return 0;
}
deque版
#include <iostream>
#include <vector>
#include <deque>
using namespace std;
const int N = 1e6 + 10;
vector<int> nums(N);
deque<int> m_deque;
int main()
{
int n, k;
cin >> n >> k;
for(int i = 0; i < n; ++i)
cin >> nums[i];
int head = 0, tail = 0;
for(int i = 0; i < n; ++i)
{
if(m_deque.size() && i - m_deque.front() + 1 > k)
m_deque.pop_front();
while(m_deque.size() && nums[m_deque.back()] >= nums[i])
m_deque.pop_back();
m_deque.push_back(i);
if(m_deque.back() >= k - 1)
cout << nums[m_deque.front()] << " ";
}
m_deque.clear();
cout << endl;
for(int i = 0; i < n; ++i)
{
if(m_deque.size() && i - m_deque.front() + 1 > k)
m_deque.pop_front();
while(m_deque.size() && nums[m_deque.back()] <= nums[i])
m_deque.pop_back();
m_deque.push_back(i);
if(m_deque.back() >= k - 1)
cout << nums[m_deque.front()] << " ";
}
return 0;
}