【POJ】2828 Buy Tickets-线段树/BIT/Treap

传送门:poj2828

---

题解

法1：非旋Treap/Splay维护名次序列
法2：倒序插入线段树(倒序插入时位置是确定的，二分求第$k$个空位)
法3：倒序插入BIT($logn$二分求$k$大)

---

代码

BIT

#include<cstdio>
#define N 200005
#define low(x) (x&(-x))
using namespace std;
int place[N],number[N];
int bittree[N];
int xl[N];
int n,m;
void insert(int _place,int num){
    int x=0;int sum=0;
    for(int i=18;i>=0;i--){
        x^=1<<i;
        if(x>n||low(x)-bittree[x]+sum>=_place) x^=1<<i;
        else sum+=low(x)-bittree[x];
    }
    xl[++x]=num;
    for(int i=x;i<=n;i+=low(i)){
        bittree[i]++;
    }
}
int main(){
    while(scanf("%d",&n)==1){
        for(int i=1;i<=n;i++){
            scanf("%d%d",&place[i],&number[i]);
            bittree[i]=0;
        }
        for(int i=n;i>=1;i--){
            insert(place[i]+1,number[i]);
        }
        for(int i=1;i<=n;i++){
            printf("%d ",xl[i]);
        }
        puts("");
    }
    return 0;
}