[POJ2828]Buy Tickets(线段树，单点更新，二分，逆序)

  1 /*
  2 ━━━━━┒ギリギリ♂ eye！
  3 ┓┏┓┏┓┃キリキリ♂ mind！
  4 ┛┗┛┗┛┃＼○／
  5 ┓┏┓┏┓┃ /
  6 ┛┗┛┗┛┃ノ)
  7 ┓┏┓┏┓┃
  8 ┛┗┛┗┛┃
  9 ┓┏┓┏┓┃
 10 ┛┗┛┗┛┃
 11 ┓┏┓┏┓┃
 12 ┛┗┛┗┛┃
 13 ┓┏┓┏┓┃
 14 ┃┃┃┃┃┃
 15 ┻┻┻┻┻┻
 16 */
 17 #include <algorithm>
 18 #include <iostream>
 19 #include <iomanip>
 20 #include <cstring>
 21 #include <climits>
 22 #include <complex>
 23 #include <fstream>
 24 #include <cassert>
 25 #include <cstdio>
 26 #include <bitset>
 27 #include <vector>
 28 #include <deque>
 29 #include <queue>
 30 #include <stack>
 31 #include <ctime>
 32 #include <set>
 33 #include <map>
 34 #include <cmath>
 35 using namespace std;
 36 #define fr first
 37 #define sc second
 38 #define cl clear
 39 #define BUG puts("here!!!")
 40 #define W(a) while(a--)
 41 #define pb(a) push_back(a)
 42 #define Rint(a) scanf("%d", &a)
 43 #define Rll(a) scanf("%lld", &a)
 44 #define Rs(a) scanf("%s", a)
 45 #define Cin(a) cin >> a
 46 #define FRead() freopen("in", "r", stdin)
 47 #define FWrite() freopen("out", "w", stdout)
 48 #define Rep(i, len) for(int i = 0; i < (len); i++)
 49 #define For(i, a, len) for(int i = (a); i < (len); i++)
 50 #define Cls(a) memset((a), 0, sizeof(a))
 51 #define Clr(a, x) memset((a), (x), sizeof(a))
 52 #define Full(a) memset((a), 0x7f7f, sizeof(a))
 53 #define lrt rt << 1
 54 #define rrt rt << 1 | 1
 55 #define pi 3.14159265359
 56 #define RT return
 57 #define lowbit(x) x & (-x)
 58 #define onenum(x) __builtin_popcount(x)
 59 typedef long long LL;
 60 typedef long double LD;
 61 typedef unsigned long long ULL;
 62 typedef pair<int, int> pii;
 63 typedef pair<string, int> psi;
 64 typedef map<string, int> msi;
 65 typedef vector<int> vi;
 66 typedef vector<LL> vl;
 67 typedef vector<vl> vvl;
 68 typedef vector<bool> vb;
 69 
 70 typedef struct Peo {
 71     int pos, val;
 72 }Peo;
 73 const int maxn =200200;
 74 int sum[maxn<<2];
 75 int n;
 76 Peo p[maxn];
 77 int ret[maxn];
 78 
 79 void pushUP(int rt) {
 80     sum[rt] = max(sum[lrt], sum[rrt]);
 81 }
 82 
 83 void build(int l, int r, int rt) {
 84     sum[rt] = r - l + 1;
 85     if(l == r) return;
 86     int m = (l + r) >> 1;
 87     build(l, m, lrt);
 88     build(m+1, r, rrt);
 89 }
 90 
 91 void update(int p, int l, int r, int rt, int& id) {
 92     sum[rt]--;
 93     if(l == r) {
 94         id = l;
 95         return;
 96     }
 97     int m = (l + r) >> 1;
 98     if(sum[lrt] >= p) update(p, l, m, lrt, id);
 99     else {
100         p -= sum[lrt];
101         update(p, m+1, r, rrt, id);
102     }
103 }
104 
105 int main() {
106     FRead();
107     while(~Rint(n)) {
108         build(1, n, 1);
109         for(int i = n - 1; i >= 0; i--) {
110             Rint(p[i].pos); Rint(p[i].val);
111         }
112         int id;
113         Rep(i, n) {
114             update(p[i].pos+1, 1, n, 1, id);
115             ret[id-1] = p[i].val;
116         }
117         Rep(i, n) printf("%d ", ret[i]);
118         printf("\n");
119     }
120     RT 0;
121 }