Buy Tickets (线段树)单点更新
来源:互联网 发布:java项目部署到tomcat 编辑:程序博客网 时间:2024/05/28 23:12
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 nextN lines contain the pairs of valuesPosi and Vali in the increasing order ofi (1 ≤i ≤ N). For each i, the ranges and meanings ofPosi andVali are as follows:
- Posi ∈ [0, i − 1] — The i-th person came to the queue and stood right behind thePosi-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 valueVali.
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.
Source
转载来自http://www.cnblogs.com/crazyapple/p/3233149.html
代码:
#include<iostream>#include<stdio.h>#include<string.h>#define N 200010#define lson k<<1#define rson k<<1|1using namespace std;struct Nod{ int l,r; int va; //¿ÕλÊý}tree[N<<2];int pos[N],val[N],ans[N];void build(int k,int l,int r){tree[k].l=l;tree[k].r=r;tree[k].va=r-l+1;if(l==r)return ;int mid=(l+r)>>1;build(lson,l,mid);build(rson,mid+1,r);}int update(int pos,int k){tree[k].va--;if(tree[k].l==tree[k].r)return tree[k].l;if(tree[lson].va>=pos)update(pos,lson);else {pos=pos-tree[lson].va;update(pos,rson);}}int main(){ int n; while(~scanf("%d",&n)) { int i; build(1,1,n); for(i=1;i<=n;i++) scanf("%d%d",&pos[i],&val[i]); for(i=n;i>=1;i--) //µ¹¹ýÀ´¸üУ¬Ôò¿ÉÒÔÈ·¶¨×îºóµÄλÖà { int id = update(pos[i]+1,1); //µÃµ½²åÈëµØ·½ ans[id] = val[i]; //´æÈëansÊý×é } for(i=1;i<n;i++) printf("%d ",ans[i]); printf("%d\n",ans[n]); } return 0;}
- poj2828 Buy Tickets 线段树,单点更新
- Buy Tickets ---- 线段树单点更新
- poj2828 Buy Tickets 单点更新线段树
- POJ2828 Buy Tickets 线段树单点更新
- poj2828 Buy Tickets(线段树,单点更新)
- Poj2828 Buy Tickets 线段树、单点更新
- POJ2828 Buy Tickets(线段树,单点更新)
- 线段树单点更新 poj2828 buy tickets
- Buy Tickets (线段树)单点更新
- Buy Tickets(线段树单点更新)
- Buy Tickets----POJ_2828----线段树之单点更新
- POJ 2828 Buy Tickets 线段树 单点更新
- Buy Tickets---poj 2828 线段树单点更新练习
- POJ 2828 Buy Tickets ( 线段树—单点更新 )
- POJ 2828 Buy Tickets (线段树单点更新)
- poj 2828 Buy Tickets(线段树单点更新)
- POJ2828 Buy Tickets 【线段树】+【单点更新】+【逆序】
- POJ 2828 Buy Tickets (线段树,单点更新)
- 度度熊与邪恶大魔王_DP
- 函数调用过程原理及函数栈帧分析
- Spring boot使用 hello world
- Java学习(九)
- libiconv Qt中的各种字符编码转化
- Buy Tickets (线段树)单点更新
- SSM整合 -- Spring和Mybatis的配置文件详解
- 第一天
- 进程控制常用的一些操作
- 密码破译问题:地球和天女星座开战了,你是地球防卫军的密码破解员,以下你是破解出来的部分密码 tyt:好 huy:这 bvn:天 jkl :是 lgc:你 qqq:哈
- 内核编译不能找到standby.code错误解决办法
- python中的 while True
- 路径寻找问题:八数码问题
- opencv在CLion下CMakeList配置