啊啊啊啊啊

#include<bits/stdc++.h>
using namespace std;
const int N=2e6+10,L=20;
int n,m,a[N],f[N][L],lg[N];
int main(){
	int i,j;
	cin>>n>>m;
	for(i=1;i<=n;i++)cin>>a[i];
	lg[1]=0;
	for(i=2;i<=n;i++)lg[i]=lg[i/2]+1;
	for(j=0;j<L;j++){
		for(i=1;i+(1<<j)-1<=n;i++){
			if(j==0)f[i][j]=a[i];
			else f[i][j]=min(f[i][j-1],f[i+(1<<j-1)][j-1]);
		}
	}for(i=1;i<=n;i++){
		int x,y,k;
		if(i==1)cout<<"0\n";
		else{
			if(i<=m){
				x=1;
				y=i-1;
			}else{
				x=i-m;
				y=i-1;
			}k=lg[y-x+1];
			cout<<min(f[x][k],f[y-(1<<k)+1][k])<<endl;	
		}
	}
	return 0;
}