洛谷P1440
筱柒Littleseven
QQ:3534947775
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define maxn 2000200
using namespace std;
int n,k,ans,a[maxn],q[maxn],minn[maxn];
int main()
{
scanf("%d%d",&n,&k); //cin>>n>>k;
for(int i=1;i<=n;i++) scanf("%d",&a[i]); //cin>>a[i];
int head=1,tail=0;
for(int i=1;i<=n;i++)
{
while(head<=tail&&i-q[head]>=k) head++;
while(head<=tail&&a[q[tail]]>=a[i]) tail--;
q[++tail]=i; minn[i]=ans; ans=a[q[head]];
}
for(int i=1;i<=n;i++) printf("%d\n",minn[i]); //cout<<minn[i]<<endl;
return 0;
}