满江红求调

#include<bits/stdc++.h>
using namespace std;
int n,k;
int a[2000007];
deque<pair<int,int> >q;
int main(){
	scanf("%d %d",&n,&k);
	for(int i=1;i<=n;i++){
		while(q.size()&&q.front().second<=i-3)q.pop_front();
		scanf("%d",&a[i]);
		while(q.size()&&q.back().first<a[i])q.pop_back();
		q.push_back({a[i],i});
		if(i>=k)printf("%d\n",q.front().first);
	}
	return 0;
}