p5156 [USACO18DEC]Sort It Out

传送门

分析

我们发现对于没有发现的点相对位置不会发生改变

于是我们可以吧问题转化为求一个lis

于是我们字典序第k小的答案就是字典序第k大的lis

代码

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<stack>
using namespace std;
#define int long long
const int inf = 1e18;
int a[],pl[],sum[],n,m;
vector<int>v[];
bool is[];
struct node {
    int ans,tot;
};
node d[];
inline void add(node &x,node y){
    if(x.ans<y.ans)x.ans=y.ans,x.tot=y.tot;
      else if(x.ans==y.ans)x.tot=min(inf,x.tot+y.tot);
}
inline int lb(int x){return x&(-x);}
inline node q(int x){node res={,1ll};while(x<=n)add(res,d[x]),x+=lb(x);return res;}
inline void add(int x,node k){while(x)add(d[x],k),x-=lb(x);}
signed main(){
    int i,j,k;
    scanf("%lld%lld",&n,&k);
    for(i=;i<=n;i++)scanf("%lld",&a[i]),pl[a[i]]=i;
    for(i=n;i>;i--){
      node res=q(pl[i]+);
      res.ans++;
      v[res.ans].push_back(i);
      sum[i]=res.tot;
      add(pl[i],res);
    }
    m=q().ans;
    int P=-;
    for(i=m;i>;i--)
      for(j=;j<v[i].size();j++){
          if(pl[v[i][j]]<P)continue;
          if(sum[v[i][j]]>=k){
            is[v[i][j]]=;
            P=pl[v[i][j]];
            break;
        }else k-=sum[v[i][j]];
      }
    printf("%lld\n",n-m);
    for(i=;i<=n;i++)
      if(!is[i])printf("%lld\n",i);
    return ;
}