单调队列模板

题面

代码

#include 
#include 
#include 
#include 
#include 
using namespace std;
struct Node
{
	int index;
	int num;
	Node(int index, int num) :index(index), num(num) {};
};
deque<Node> q;


int main()
{
#ifdef LOCAL
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
#endif

	int n, k;
	cin >> n >> k;
	for (int i = 0; i < n; i++) {
		int num; cin >> num;
		Node temp = Node(i, num);

		if (!q.empty() && q.front().index < i - k + 1) q.pop_front();
		while (!q.empty() && q.back().num < num) q.pop_back();

		q.push_back(temp);

		if (i >= k - 1) {
			cout << q.front().num << endl;
		}
	}

	return 0;
}