数据结构：队列

模拟队列

题目
题解

#include <iostream>
using namespace std;
int m, head, ed;
int list_num[100010];
int main()
{
	cin >> m;
	for (int i = 0; i < m; i ++ ) {
		string op;
		cin >> op;
		if (op == "push") {
			int x;
			cin >> x;
			list_num[ed ++ ] = x;
		} 
		else if (op == "pop") head ++ ;
		else if (op == "empty") {
			cout << (head == ed ? "YES" : "NO") << endl;
//			if (head == ed) cout << "YES" << endl;
//			else cout << "NO" << endl; 
		}
		else cout << list_num[head] << endl; 
	}
	return 0;
}

单调队列 滑动窗口

题目
题解

#include <iostream>
using namespace std;
const int N = 1000010;
int num[N], q[N];
int main()
{
	int n, k;
	cin >> n >> k;
	for (int i = 0; i < n; i ++ ) cin >> num[i];
	int head = 0, end = -1;
	for(int i = 0; i < n; i ++ ) {
		if (head <= end && i - k + 1 > q[head]) head ++ ;
		while (head <= end && num[q[end]] > num[i]) end -- ;
		q[ ++ end] = i;
		if (i >= k - 1) cout << num[q[head]] << " ";
	}
	cout << endl;
	head = 0, end = -1;
	for (int i = 0; i < n; i ++ ) {
		if (head <= end && i - k + 1 > q[head]) head ++ ;
		while (head <= end && num[q[end]] <= num[i]) end -- ;
		q[ ++ end] = i;
		if (i >= k - 1) cout << num[q[head]] << " ";
	}
	cout << endl;
	return 0;
}