Buy Tickets
Time Limit: 4000MS   Memory Limit: 65536K
Total Submissions: 12930   Accepted: 6412

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 ≤ i ≤ N). 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.

Source

 
代码:   倒着插入数据....
代码:
 #include<cstdio>
#include<cstring>
const int maxn=;
struct node
{
int lef,rig,ps; //ps-->在前方有多少个空位
int val;
int mid(){
return lef+((rig-lef)>>);
}
};
struct sac
{
int pos,val;
};
sac sav[maxn];
node reg[maxn<<];
int ans[maxn];
int cnt;
void Build(int left,int right,int pos)
{
reg[pos]=(node){left,right,,};
if(left==right) return ;
int mid=reg[pos].mid();
Build(left,mid,pos<<);
Build(mid+,right,pos<<|);
reg[pos].ps=reg[pos<<].ps+reg[pos<<|].ps;
} void Update(int ps,int val ,int pos)
{
if(reg[pos].lef==reg[pos].rig)
{
reg[pos].ps=;
reg[pos].val=val;
return ;
}
int mid=reg[pos].mid();
if(reg[pos<<].ps>ps)
Update(ps,val,pos<<);
else Update(ps-reg[pos<<].ps,val,pos<<|);
reg[pos].ps=reg[pos<<].ps+reg[pos<<|].ps;
return ;
}
void Query(int pos)
{
if(reg[pos].lef==reg[pos].rig)
{
if(cnt==)
printf("%d",reg[pos].val);
else printf(" %d",reg[pos].val);
cnt++;
return ;
}
int mid=reg[pos].mid();
Query(pos<<);
Query(pos<<|);
return ;
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
cnt=;
Build(,n,);
for(int i=;i<n;i++)
scanf("%d%d",&sav[i].pos,&sav[i].val);
for(int i=n-;i>=;i--)
Update(sav[i].pos,sav[i].val,);
Query();
puts("");
}
return ;
}

优化代码:

 #include<cstdio>
#include<cstring>
const int maxn=;
struct node
{
int lef,rig,ps; //ps-->在前方有多少个空位
int mid(){
return lef+((rig-lef)>>);
}
};
struct sac
{
int pos,val;
};
sac sav[maxn];
node reg[maxn<<];
int ans[maxn];
void Build(int left,int right,int pos)
{
reg[pos]=(node){left,right,};
if(left==right) return ;
int mid=reg[pos].mid();
Build(left,mid,pos<<);
Build(mid+,right,pos<<|);
reg[pos].ps=reg[pos<<].ps+reg[pos<<|].ps;
} void Update(int ps,int val ,int pos)
{
if(reg[pos].lef==reg[pos].rig)
{
reg[pos].ps=;
ans[reg[pos].lef]=val;
return ;
}
int mid=reg[pos].mid();
if(reg[pos<<].ps>ps)
Update(ps,val,pos<<);
else Update(ps-reg[pos<<].ps,val,pos<<|);
reg[pos].ps=reg[pos<<].ps+reg[pos<<|].ps;
return ;
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
Build(,n,);
for(int i=;i<n;i++)
scanf("%d%d",&sav[i].pos,&sav[i].val);
for(int i=n-;i>=;i--)
Update(sav[i].pos,sav[i].val,);
printf("%d",ans[]);
for(int i=;i<=n;i++)
printf(" %d",ans[i]);
puts("");
}
return ;
}

poj-----(2828)Buy Tickets(线段树单点更新)的更多相关文章

  1. POJ 2828 Buy Tickets(线段树单点)

    https://vjudge.net/problem/POJ-2828 题目意思:有n个数,进行n次操作,每次操作有两个数pos, ans.pos的意思是把ans放到第pos 位置的后面,pos后面的 ...

  2. POJ - 2828 Buy Tickets (段树单点更新)

    Description Railway tickets were difficult to buy around the Lunar New Year in China, so we must get ...

  3. poj 2828 Buy Tickets (线段树(排队插入后输出序列))

    http://poj.org/problem?id=2828 Buy Tickets Time Limit: 4000MS   Memory Limit: 65536K Total Submissio ...

  4. POJ 2828 Buy Tickets (线段树 or 树状数组+二分)

    题目链接:http://poj.org/problem?id=2828 题意就是给你n个人,然后每个人按顺序插队,问你最终的顺序是怎么样的. 反过来做就很容易了,从最后一个人开始推,最后一个人位置很容 ...

  5. POJ 2828 Buy Tickets 线段树 倒序插入 节点空位预留(思路巧妙)

    Buy Tickets Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 19725   Accepted: 9756 Desc ...

  6. POJ 2828 Buy Tickets(线段树&#183;插队)

    题意  n个人排队  每一个人都有个属性值  依次输入n个pos[i]  val[i]  表示第i个人直接插到当前第pos[i]个人后面  他的属性值为val[i]  要求最后依次输出队中各个人的属性 ...

  7. POJ 2828 Buy Tickets | 线段树的喵用

    题意: 给你n次插队操作,每次两个数,pos,w,意为在pos后插入一个权值为w的数; 最后输出1~n的权值 题解: 首先可以发现,最后一次插入的位置是准确的位置 所以这个就变成了若干个子问题, 所以 ...

  8. poj 2828 Buy Tickets (线段树)

    题目:http://poj.org/problem?id=2828 题意:有n个人插队,给定插队的先后顺序和插在哪个位置还有每个人的val,求插队结束后队伍各位置的val. 线段树里比较简单的题目了, ...

  9. poj 2892---Tunnel Warfare(线段树单点更新、区间合并)

    题目链接 Description During the War of Resistance Against Japan, tunnel warfare was carried out extensiv ...

随机推荐

  1. Cheatsheet: 2014 04.01 ~ 04.30

    Java 115 Java Interview Questions and Answers – The ULTIMATE List 3 Good Reasons to Avoid Arrays in ...

  2. CUBRID学习笔记 30 复制表结构 cubrid教程

    语法 CREATE {TABLE | CLASS} <new_table_name> LIKE <old_table_name> 如下 CREATE TABLE a_tbl( ...

  3. iOS问题处理:如何在Mac下显示Finder中的所有文件

    摘自:http://www.cnblogs.com/elfsundae/archive/2010/11/30/1892544.html 在Unix下工作,你可能需要处理一些“特殊“文件或文件夹,例如/ ...

  4. Java内存区域和判断对象“死”“活”算法

    转载自: http://www.cnblogs.com/aigongsi/archive/2012/04/06/2434771.html java与C,c++有很大的不同就是java语言开发者不需要关 ...

  5. ASP.NET常用正则表达式

    验证数字:^[0-9]*$ 验证n位的数字:^\d{n}$ 验证至少n位数字:^\d{n,}$ 验证m-n位的数字:^\d{m,n}$ 验证零和非零开头的数字:^(0|[1-9][0-9]*)$ 验证 ...

  6. OC面向对象及继承

    1. 面向对象它通过给程序中加入扩展语句,把函数“封装”进编程所必需的“对象”中.面向对象的编程语言使得复杂的工作条理清晰.编写容易.说它是一场革命,不是对对象本身而言,而是对它们处理工作的能力而言. ...

  7. bootstrap 手风琴效果

    <!DOCTYPE HTML> <html><head><meta charset="utf-8"><title>按钮插 ...

  8. DOM节点操作

    请尊重知识,请尊重原创 更多资料参考请见  http://www.cezuwang.com/listFilm?page=1&areaId=906&filmTypeId=1  一.创建节 ...

  9. Unix domain sockets

    #server: SERVER_PATH = "/tmp/python_unix_socket_server" def run_unix_domain_socket_server( ...

  10. 使用fragmenttabhost后,子fragment怎么获取ID?怎么用getSharedPreferences

    使用fragmenttabhost后,子fragment怎么获取ID?怎么用getSharedPreferences public View onCreateView(LayoutInflater i ...