POJ 2828 Buy Tickets(线段树--单点更新)
来源:互联网 发布:复杂网络传播模型 编辑:程序博客网 时间:2024/05/14 16:10
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.
ac代码:
#include<stdio.h>struct s{int sum;int left;int right;}tree[4000000];int ans[200000+10];int q[200000+10];int w[200000+1];void build(int l,int r,int i){int mid;tree[i].left=l;tree[i].right=r;if(l==r){tree[i].sum=1;return;}mid=(l+r)/2;build(l,mid,i*2);build(mid+1,r,i*2+1);tree[i].sum=tree[i*2].sum+tree[i*2+1].sum;}void update(int c,int d,int i){int mid;if(tree[i].left==tree[i].right){tree[i].sum=0;ans[tree[i].right]=d;return;}mid=(tree[i].left+tree[i].right)/2;if(c<tree[i*2].sum)update(c,d,i*2);elseupdate(c-tree[i*2].sum,d,i*2+1);tree[i].sum=tree[i*2].sum+tree[i*2+1].sum;}int main(){int i,n;while(scanf("%d",&n)!=EOF){build(0,n-1,1);for(i=0;i<n;i++)scanf("%d%d",&q[i],&w[i]);for(i=n-1;i>=0;i--){update(q[i],w[i],1);}for(i=0;i<n;i++)printf(i==n-1?"%d\n":"%d ",ans[i]);}return 0;}
- 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 线段树 单点更新
- 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 线段树单点更新
- C#125个基本的面试问答清单
- 二分查找的两种写法
- 树莓派安装中文字库和输入方法
- 源泉书签今日更新:在用户注册后,会显示首页的超链接,操作更加人性化
- 浅谈操作系统对内存的管理
- POJ 2828 Buy Tickets(线段树--单点更新)
- 初识NSQ分布式实时消息架构
- STL之双向链表及其迭代器简单实现
- 一亿以内的回文素数
- jQueryMobile的组件之下拉菜单(selectMenu)
- easyUI comboTree的实现
- Java基础语法(下)
- HP-EPM第一周
- nfs启动报错