【POJ 2828】Buy Tickets

【题目链接】

http://poj.org/problem?id=2828

【算法】

离线用线段树维护序列即可

【代码】

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cerrno>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <limits>
#include <list>
#include <map>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <utility>
#include <vector>
#include <cwchar>
#include <cwctype>
#include <stack>
#include <limits.h>
using namespace std;
#define MAXN 200010

int i,n;
int pos[MAXN],val[MAXN];

struct SegmentTree
{
    struct Node
    {
        int l,r;
        int cnt,val;
    } Tree[MAXN<<];
    inline void build(int index,int l,int r)
    {
        int mid;
        Tree[index].l = l;
        Tree[index].r = r;
        Tree[index].cnt = r - l + ;
        if (l == r) return;
        mid = (l + r) >> ;
        build(index<<,l,mid);
        build(index<<|,mid+,r);
    }
    inline void update(int index)
    {
        Tree[index].cnt = Tree[index<<].cnt + Tree[index<<|].cnt;
    }
    inline void insert(int index,int pos,int val)
    {
        int mid;
        if (Tree[index].l == Tree[index].r)
        {
            Tree[index].cnt = ;
            Tree[index].val = val;
            return;
        }
        mid = (Tree[index].l + Tree[index].r) >> ;
        if (Tree[index<<].cnt >= pos) insert(index<<,pos,val);
        else insert(index<<|,pos - Tree[index<<].cnt,val);
        update(index);
    }
    inline void output(int index)
    {
        int mid;
        if (Tree[index].l == Tree[index].r) printf("%d ",Tree[index].val);
        else
        {
            output(index<<);
            output(index<<|);
        }
    }
} T;

int main()
{

    while (scanf("%d",&n) != EOF)
    {
        for (i = ; i <= n; i++) scanf("%d%d",&pos[i],&val[i]);
        T.build(,,n);
        for (i = n; i >= ; i--) T.insert(,pos[i]+,val[i]);
        T.output();
        printf("\n");
    }

    return ;
}