【POJ】2828 Buy Tickets

线段树+逆序插入。

 #include <stdio.h>
 #include <string.h>

 #define MAXN 200005
 #define lson l, mid, rt<<1
 #define rson mid+1, r, rt<<1|1

 int space[MAXN<<];
 int nums[MAXN];
 int pi[MAXN], vi[MAXN];
 int pos;

 void build(int l, int r, int rt) {
     int mid;
     space[rt] = r - l +;
     if (l == r)
         return ;
     mid = (l+r)>>;
     build(lson);
     build(rson);
 }

 void update(int p, int l, int r, int rt) {
     int mid;
     --space[rt];
     if (l == r) {
         pos = l;
         return ;
     }
     mid = (l+r) >> ;
     if (space[rt<<] >= p)
         update(p, lson);
     else {
         p -= space[rt<<];
         update(p, rson);
     }
 }

 int main() {
     int i, n;

     while (scanf("%d", &n) != EOF) {
         build(, n, );
         for (i=; i<=n; ++i)
             scanf("%d %d", &pi[i], &vi[i]);
         for (i=n; i>; --i) {
             update(pi[i]+, , n, );
             nums[pos] = vi[i];
             //printf("pos=%d\n", pos);
         }
         printf("%d", nums[]);
         for (i=; i<=n; ++i)
             printf(" %d", nums[i]);
         printf("\n");
     }

     return ;
 }