POJ 2828 Buy Tickets(线段树—查找并更新从左到右的第i个1)
来源:互联网 发布:久其软件 决算 编辑:程序博客网 时间:2024/06/05 11:20
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 Valiin 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 512 691 3341 192430 205231 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.
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;#define maxn 200020#define lson i*2,l,m#define rson i*2+1,m+1,rint pos[maxn],val[maxn];int val_prin[maxn*4],sum[maxn*4];int cnt,n;void PushUp(int i){sum[i]=sum[i*2]+sum[i*2+1];}void build(int i,int l,int r){if(l==r){sum[i]=1;return ;}int m=(l+r)/2;build(lson);build(rson);PushUp(i);}void update(int p,int v,int i,int l,int r){if(l==r){if(sum[i]==1){sum[i]=0;val_prin[i]=v;}return ;}int m=(l+r)/2;if(p<=sum[i*2])update(p,v,lson);else update(p-sum[i*2],v,rson);//往右边查找时,注意要将pos的值减去左边树上的1的个数 PushUp(i); } void print(int i,int l,int r){if(l==r){cnt++;printf("%d",val_prin[i]);if(cnt<n)printf(" ");elseprintf("\n");return ;}int m=(l+r)/2;print(lson);//输出要求是按队伍顺序输出,即在树的节点上是从左往右输出 print(rson);}int main(){int i;while(scanf("%d",&n)!=EOF&&n){cnt=0;build(1,1,n);for(i=1;i<=n;++i)scanf("%d%d",&pos[i],&val[i]);for(i=n;i>0;--i){int p=pos[i];p++;int v=val[i];update(p,v,1,1,n);}print(1,1,n);}return 0;}
- POJ 2828 Buy Tickets(线段树—查找并更新从左到右的第i个1)
- POJ 2828 Buy Tickets(线段树:查找并更新从左到右第i个1)
- POJ 2828 Buy Tickets (线段树 单点更新-查找第k大元素)
- POJ 2828 Buy Tickets(线段树的单点更新)
- POJ 2828 Buy Tickets ( 线段树—单点更新 )
- Buy Tickets+POJ+线段树单点更新的灵活运用
- POJ 2828 Buy Tickets 线段树 单点更新
- 线段树端点更新 poj 2828 Buy Tickets
- Buy Tickets---poj 2828 线段树单点更新练习
- 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(线段树单点更新)
- Unity基于NGUI实现拖拽功能
- 8. Smarty 基本语法
- Android 5.0之后 点击 悬浮穿回到顶部。
- Android中SQLite的使用
- [BZOJ3571][HNOI2014]画框
- POJ 2828 Buy Tickets(线段树—查找并更新从左到右的第i个1)
- fms服务端语法
- Android Hanlder综合
- XZ_iOS中推送通知~本地推送通知的实现
- 太阳理论
- 上下界网络流
- Codeforces 633D Fibonacci-ish(暴力)
- 为什么子线程不能更新Toas
- android绘图Paint.setXfermode()和Canvas.saveLayer()方法的作用