ST表91分求调

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=2e6+5;
ll n,m;
ll st[N][20];
int main(){
	scanf("%lld%lld",&n,&m);
	st[0][0]=0x7fffffff;
	for(int i=1;i<=n;i++) scanf("%lld",&st[i][0]);
	for(int j=1;j<20;j++) for(int i=0;i+(1<<j-1)<=n;i++) st[i][j]=min(st[i][j-1],st[i+(1<<j-1)][j-1]);
	printf("0\n");
	for(int r=1;r<n;r++){
		int l=r-m+1;
		l=max(0,l);
		ll k=log2(r-l+1);
		printf("%lld\n",min(st[l][k],st[r-(1<<k)+1][k]));
	}
	return 0;
}