poj 2828 Buy Tickets

从后往前更新，tree[i].num表示区间的空位数。
Source Code
Problem: 2828		User: yanxiaoli
Memory: 8700K		Time: 1625MS
Language: C++		Result: Accepted
Source Code
#include<stdio.h>
struct node{
int l;
int r;
int num;
}tree[600000];
int num[600000],value[600000],a[600000];
int n;

void build_tree(int i,int l,int r)
{
   tree[i].l=l;
   tree[i].r=r;
   tree[i].num=r-l+1;
   if(l==r)
     return;
   int mid=(l+r)/2;
   build_tree(2*i,l,mid);
   build_tree(2*i+1,mid+1,r);
}

void updata(int i,int id,int val)
{
    if(tree[i].l==tree[i].r)
    {
       tree[i].num=0;
       a[tree[i].l]=val;
       return;
    }
    if(id<tree[2*i].num) updata(2*i,id,val);
    else updata(2*i+1,id-tree[2*i].num,val);
    tree[i].num=tree[2*i].num+tree[2*i+1].num;
}

int main()
{
    while(scanf("%d",&n)!=EOF)
    {
      build_tree(1,1,n);
      int i;
      for(i=1;i<=n;i++)
         scanf("%d%d",&num[i],&value[i]);
      for(i=n;i>=1;i--)
         updata(1,num[i],value[i]);
      for(i=1;i<n;i++)
         printf("%d ",a[i]);
      printf("%d\n",a[n]);
    }
    return 0;
}