#include<bits/stdc++.h>
using namespace std;
struct kkk{
int v,id;
};
int n,k;
kkk a[2000005];
deque<kkk>q;
int main(){
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>a[i].v;
a[i].id=i;
}
for(int i=1;i<=n;i++){
// cout<<"hhh\n";
while(!q.back().v<=a[i].v&&q.empty())q.pop_back();
q.push_back(a[i]);
if(i==k+q.front().id)q.pop_front();
if(i>=k)cout<<q.front().v<<endl;
}
return 0;
}
和题解思路相同,可是RE了,请dl赐教!