Buy Tickets - POJ 2828 线段树
来源:互联网 发布:淘宝越墙vans是正品吗 编辑:程序博客网 时间:2024/06/12 02:40
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
40 771 511 332 6940 205231 192431 38900 31492
Sample Output
77 33 69 5131492 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.
题意:依次操作,让第i个人跻身到第几个人的后面。问最后的结果。
思路:逆向看,比如2 69 的话,就让69的位置固定到从前往后的第3个空位,以此类推。
AC代码如下:
#include<cstdio>#include<cstring>using namespace std;struct node{ int num,l,r;}tree[800010];int ans[200010],f1[200010],f2[200010];void build(int o,int l,int r){ tree[o].l=l; tree[o].r=r; tree[o].num=r-l+1; if(l==r) return; int mi=(l+r)/2; build(o*2,l,mi); build(o*2+1,mi+1,r);}void update(int o,int pos){ if(tree[o].l==pos && tree[o].r==pos) { tree[o].num=0; return; } int mi=(tree[o].l+tree[o].r)/2; if(pos<=mi) update(o*2,pos); else update(o*2+1,pos); tree[o].num=tree[o*2].num+tree[o*2+1].num;}int query(int o,int num){ if(tree[o].l==tree[o].r && num==1) return tree[o].l; int mi=(tree[o].l+tree[o].r)/2; if(tree[o*2].num>=num) return query(o*2,num); else return query(o*2+1,num-tree[o*2].num);}int main(){ int n,i,j,k,ret,pos; while(~scanf("%d",&n)) { build(1,1,n); for(i=1;i<=n;i++) scanf("%d%d",&f1[i],&f2[i]); for(i=n;i>=1;i--) { k=f1[i]+1; pos=query(1,k); ans[pos]=f2[i]; update(1,pos); } printf("%d",ans[1]); for(i=2;i<=n;i++) printf(" %d",ans[i]); printf("\n"); }}
- POJ 2828 Buy Tickets(线段树)
- POJ 2828 Buy Tickets 线段树
- poj 2828 Buy Tickets(线段树)
- poj 2828 Buy Tickets 线段树!!!
- poj 2828 Buy Tickets 线段树
- POJ-2828 Buy Tickets 线段树
- poj 2828 Buy Tickets【线段树】
- POJ 2828 Buy Tickets(线段树)
- POJ 2828 Buy Tickets 线段树
- poj 2828 Buy Tickets(线段树)
- POJ 2828 Buy Tickets(线段树)
- POJ 2828 Buy Tickets 线段树
- 【线段树】poj 2828 Buy Tickets
- POJ:2828 Buy Tickets(线段树)
- POJ-2828 Buy Tickets 线段树
- POJ 2828 Buy Tickets 线段树解法
- POJ 2828 Buy Tickets 线段树
- POJ--2828--Buy Tickets【线段树】
- 【C语言基础】C语言第七章
- 集线器,交换机,路由器。。
- Undefined exploded archive location Tomcat之项目不能发布
- 第一次在CSDN上发表博客
- 存储过程中遇到ora-00942表或视图不存在
- Buy Tickets - POJ 2828 线段树
- java学习之路------变量初始化
- 记实习生电面
- 十分钟掌握diff&patch用法
- PS 滤镜——旋转模糊
- 最短路径问题
- Android adb 无线调试程序 仅需3步
- PreparedStatement 和Statement用法区别,加和不加转义字符
- Windows如何打包Qt程序