在线求调

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
//十年OI一场空，不开long long见祖宗
int n , k , a[1000010];
deque<int> q;
int main(){
	scanf("%d" , &n);
	for(int i = 1 ; i <= n ; ++i)
		scanf("%d" , &a[i]);
	for(int i = 1 ; i <= n ; ++i){
		while((!q.empty())&& a[i] >= a[q.back()])
			q.pop_back();
		q.push_back(i);
		while(q.front() <= i - k)
			q.pop_front();
		if(i >= k)
			printf("%d " , a[q.front()]);
	}
	return 0;
}