#include<cstdio>
#include<cmath>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int f[210000][21];
int read(){
char x;
while((x=getchar())>'9' ||x<'0');
int u=x-'0';
while((x=getchar())<='9' && x>='0')u=u*10+x-'0';
return u;
}
void RMQ(int x){
int i,j;
for(i=1;i<=20;i++)
for(j=1;j<=x;j++)
if(j+(1<<i)-1<=x)
f[j][i]=min(f[j][i-1],f[j+(1<<(j-1))][i-1]);
}
int main(){
#ifndef ONLINE_JUDGE
freopen("input.in","r",stdin);
freopen("output.out","w",stdout);
#endif
int i,j,k,m,n;
n=read();
m=read();
for(i=1;i<=n;i++)
f[i][0]=read();
RMQ(n);
printf("0\n");
k=log(m)/log(2);
for(i=2;i<=n;i++){
int u=i-m;
if(u<=0)u=1;
printf("%d\n",min(f[u][k-1],f[u+(1<<(k-1))][k-1]));
}
return 0;
}
MADE by 羅旅洲RMQ模板(不保證正確)
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.