题目链接
思路:
单调队列。
代码:
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N=2e5+7;
const int mod=1e9+7;
const int inf=0x7fffffff;
const double pi=3.1415926535;
using namespace std;
int a[N],b[N];
signed main()
{
IOS;
int n,m;
cin>>n>>m;
deque<int>q;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
q.push_back(1);
for(int i=2;i<=n;i++)
{
while(q.size()&&i-q.front()>m)
{
q.pop_front();
}
b[i]=a[q.front()];
while(q.size()&&a[q.back()]>a[i])
{
q.pop_back();
}
q.push_back(i);
}
for(int i=1;i<=n;i++)
{
cout<<b[i]<<endl;
}
return 0;
}