POJ2828（线段树）

</pre><pre code_snippet_id="1730027" snippet_file_name="blog_20160625_1_8456118" name="code" class="cpp">/*http://www.cnblogs.com/CheeseZH/archive/2012/04/29/2476134.html上面讲的很详细*/

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<math.h>
using namespace std;
int  rrr=0;
class question{
public:
    int position;
    int number;
}qq[600000+200];
int spare[600000*2+200];
int nn[600000*2+200];
int zi[600000*2+200];

void push_up(int rt)
{
    spare[rt]=spare[rt<<1|1]+spare[rt<<1];
}

void build(int l,int r,int rt)
{
    if(l==r)
    {
//        for(int i=1;i<=40;i++)
//        {
//            printf("%d ",zi[i]);
//        }
//        printf("\n");
        spare[rt]=1;
        zi[rt]=1;
        return ;
    }
    int mid=(l+r)/2;
    build(l,mid,rt<<1);
    build(mid+1,r,rt<<1|1);
    push_up(rt);
}

void up_date(int rt,int key1,int key2)
{
    spare[rt]-=1;
     while(zi[rt]==0)
    {
        if(key1>spare[rt*2])
        {
            key1-=spare[rt*2];
            rt=rt*2+1;
        }
        else
        {
            rt*=2;
        }
        spare[rt]-=1;
    }
    nn[rt]=key2;
    return ;
}
int main()
{	//freopen("F://input.txt","r",stdin);
	//freopen("F://output1.txt","w",stdout);
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        memset(qq,0,sizeof(qq));
        memset(spare,0,sizeof(spare));
        memset(zi,0,sizeof(zi));
        memset(nn,0,sizeof(nn));
        int i,q,w;
        for(i=1;i<=n;i++)
        {
            scanf("%d%d",&qq[i].position,&qq[i].number);
        }
        long long nnn=1;
        while(nnn<n)
        {
            nnn*=2;
        }
        build(1,nnn,1);
        for(i=n;i>=1;i--)
        {
          rrr=qq[i].number;
          up_date(1,qq[i].position+1,qq[i].number);
        }
        for(i=1;;i++)
        {
            if(nn[i]!=0)break;
        }
        for(q=1;q<n;i++,q++)
        {
            printf("%d ",nn[i]);
        }
        printf("%d\n",nn[i]);
    }
    return 0;
}