TLE82分求调

#include<bits/stdc++.h>
using namespace std;
int n,m,maxx,head=0,tail=-1,minn=10000000;
int a[10005],qm[10005],s[10005];
int main() {
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		s[i]=minn;
		if(i<=m && minn>a[i]) minn=a[i];
	}
	cout<<"0"<<endl;
	for(int i=2;i<=m;i++) cout<<s[i]<<endl;
	for(int i=1;i<n;i++){
		if(head<=tail && i-qm[head]>=m) head++;
		while(head<=tail && a[qm[tail]]>a[i]) tail--;
		tail++;  
		qm[tail]=i;
		if(i>=m) cout<<a[qm[head]]<<endl;
	}
    return 0;
}