# poj Buy Tickets 2828 （线段树） 好题

Buy Tickets
 Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 16584 Accepted: 8268

Description

Railway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue…

The Lunar New Year was approaching, but unluckily the Little Cat still had schedules going here and there. Now, he had to travel by train to Mianyang, Sichuan Province for the winter camp selection of the national team of Olympiad in Informatics.

It was one o’clock a.m. and dark outside. Chill wind from the northwest did not scare off the people in the queue. The cold night gave the Little Cat a shiver. Why not find a problem to think about? That was none the less better than freezing to death!

People kept jumping the queue. Since it was too dark around, such moves would not be discovered even by the people adjacent to the queue-jumpers. “If every person in the queue is assigned an integral value and all the information about those who have jumped the queue and where they stand after queue-jumping is given, can I find out the final order of people in the queue?” Thought the Little Cat.

Input

There will be several test cases in the input. Each test case consists of N + 1 lines where N (1 ≤ N ≤ 200,000) is given in the first line of the test case. The next N lines contain the pairs of values Posi and Vali in the increasing order of i (1 ≤ iN). For each i, the ranges and meanings of Posi and Vali are as follows:

• Posi ∈ [0, i − 1] — The i-th person came to the queue and stood right behind the Posi-th person in the queue. The booking office was considered the 0th person and the person at the front of the queue was considered the first person in the queue.
• Vali ∈ [0, 32767] — The i-th person was assigned the value Vali.

There no blank lines between test cases. Proceed to the end of input.

Output

For each test cases, output a single line of space-separated integers which are the values of people in the order they stand in the queue.

Sample Input

4
0 77
1 51
1 33
2 69
4
0 20523
1 19243
1 3890
0 31492

Sample Output

77 33 69 51
31492 20523 3890 19243

Hint

The figure below shows how the Little Cat found out the final order of people in the queue described in the first test case of the sample input.

//题意：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#define N 200010
using namespace std;
struct zz
{
int l;
int r;
int v;
int p;
}q[N<<2];
struct z
{
int p;
int v;
}Q[N];
int dis[N];
int k;
void build(int gen,int l,int r)
{
q[gen].l=l;
q[gen].r=r;
if(l==r)
{
q[gen].p=1;
return ;
}
int mid=(l+r)/2;
build(gen<<1,l,mid);
build(gen<<1|1,mid+1,r);
q[gen].p=q[gen<<1].p+q[gen<<1|1].p;
}
void update(int gen,int v,int p)
{
if(q[gen].l==q[gen].r)
{
q[gen].v=v;
q[gen].p=0;
return ;
}
if(q[gen<<1].p>p)
update(gen<<1,v,p);
else
update(gen<<1|1,v,p-q[gen<<1].p);
q[gen].p=q[gen<<1].p+q[gen<<1|1].p;
}
void query(int gen)
{
if(q[gen].l==q[gen].r)
{
dis[k++]=q[gen].v;
return ;
}
query(gen<<1);
query(gen<<1|1);
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
k=0;
for(int i=0;i<n;i++)
scanf("%d%d",&Q[i].p,&Q[i].v);
build(1,1,n);
for(int i=n-1;i>=0;i--)
update(1,Q[i].v,Q[i].p);
query(1);
for(int i=0;i<n-1;i++)
printf("%d ",dis[i]);
printf("%d\n",dis[n-1]);
}
return 0;
}

• 本文已收录于以下专栏：

## poj2828--Buy Tickets(线段树+详解)

Buy Tickets Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 13618   A...
• u013015642
• 2014年09月23日 20:10
• 1011

## POJ 2828 Buy Tickets 题解&代码

• Rainbow6174
• 2015年12月03日 19:43
• 405

## POJ2828：Buy Tickets(线段树单点)

Description Railway tickets were difficult to buy around the Lunar New Year in China, so we must ge...
• libin56842
• 2013年10月24日 17:01
• 4788

## poj 2828 Buy Tickets 线段树！！！

• youngyangyang04
• 2012年06月07日 17:03
• 338

## POJ:2828 Buy Tickets(线段树)

• kkkwjx
• 2014年03月14日 14:47
• 411

## POJ 2828 - Buy Tickets(线段树)

Buy Tickets Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 19367 Accepted:...
• Snakeflute
• 2017年01月14日 00:41
• 190

## POJ 2828 Buy Tickets（线段树 ）

Description Railway tickets were difficult to buy around the Lunar New Year in China, so we must ...
• know_heng
• 2017年04月12日 10:28
• 57

## poj 2828 Buy Tickets 线段树

#include #include #include #include #include #include using namespace std; int n, m, sum, count, f...
• u013934593
• 2014年08月11日 15:36
• 359

## POJ 2828 Buy Tickets（线段树）

Language: Default Buy Tickets Time Limit: 4000MS   Memory Limit: 65536K Total Su...
• u014737310
• 2014年10月23日 20:28
• 748

## poj 2828 Buy Tickets 线段树

• qq_33229466
• 2015年12月23日 20:52
• 228

举报原因： 您举报文章：poj Buy Tickets 2828 （线段树） 好题 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)