我们至今仍无法解决WA这一不治之症QAQ

#include<iostream>
#include<deque> 
using namespace std;
long long n,k,t;
long long num[1000500];
deque <long long>a;
int main(){
	cin>>n>>k;
	for(long long i=0;i<n;i++)scanf("%lld",&num[i]);
	t=0;
	for(long long i=0;i<n;i++){
		while(!a.empty()&&a.back()>=num[i])a.pop_back();
		a.push_back(num[i]);
		if(i-t>=k&&num[t]==a.front()){
			t++;a.pop_front();
		}
		if(i-t>=k&&num[t]!=a.front())t++;
		if(i>=k-1)cout<<a.front()<<" ";
	}
	cout<<endl;a.clear();
	t=0;
	for(long long i=0;i<n;i++){
		while(!a.empty()&&a.back()<=num[i])a.pop_back();
		a.push_back(num[i]);
		if(i-t>=k&&num[t]==a.front()){
			t++;a.pop_front();
		}
		if(i-t>=k&&num[t]!=a.front())t++;
		if(i>=k-1)cout<<a.front()<<" ";
	}
	return 0;
}