https://www.luogu.org/problem/show?pid=1440
优先队列模版题么;
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
#define Ll long long
using namespace std;
int a[2000005],f[2000005];
int n,m,l,r;
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
l=r=1;f[1]=1;
cout<<0<<endl;
for(int i=2;i<=n;i++){
while(i-f[l]>m)l++;
printf("%d\n",a[f[l]]);
while(r>=l&&a[f[r]]>=a[i])r--;
f[++r]=i;
}
}
刷题到道路游戏,要在dp里面套一个优先队列,忘了怎么做;