POJ 2828 Buy Tickets --线段树

POJ 2828 Buy Tickets

后面以此类推

则我们每次查找的是排除确定好的pos后对应的新pos所在数组的位置用ans数组存值即可

//#include<bits/stdc++.h>
#include<iostream>
#include<vector>
//#include <unordered_map>
using namespace std;
//template<class...Args>
//void debug(Args... args) {//Parameter pack
//    auto tmp = { (cout << args << ' ', 0)... };
//    cout << "\n";
//}
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll>pll;
typedef pair<int, int>pii;
const ll N = 5e5 + 5;
const ll INF = 0x7fffffff;
const ll MOD = 1e9+7;

struct node {
    int l, r;
    int sum;
}tree[N<<2];
void push_up(int root) {
    tree[root].sum = tree[root << 1].sum + tree[root << 1 | 1].sum;
}
void build(int root, int l, int r) {
    if (l == r)tree[root] = { l,r,1 };
    else {
        tree[root] = { l,r };
        int mid = l + r >> 1;
        build(root << 1, l, mid);
        build(root << 1 | 1, mid + 1, r);
        push_up(root);
    }
}
int query(int root, int pos) {
    tree[root].sum--;
    if (tree[root].l == tree[root].r)return tree[root].l;
    if (tree[root << 1].sum >= pos)return query(root << 1, pos);
    else return query(root << 1 | 1, pos - tree[root << 1].sum);
}
int main() {
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);

    int n;
    while (cin >> n) {
        vector<int>pos(n+5), num(n+5), ans(n+5);
        build(1, 1, n);
        for (int i = 1; i <= n; i++) cin >> pos[i] >> num[i];
        for (int i = n; i >= 1; i--) {
            int p = query(1, pos[i] + 1);
            ans[p] = num[i];
        }
        for (int i = 1; i <= n; i++)cout << ans[i] << " ";
        cout << "\n";
    }
    
    return 0;
}