poj2828 Buy Tickets(线段树)
来源:互联网 发布:2k16捏脸数据 姚明 编辑:程序博客网 时间:2024/06/05 20:06
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 Nlines 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.
maxn=2000000;
type
tnode=record
a,b,c:longint;
end;
var
tree:array[0..maxn] of tnode;
a,p,v:array[0..maxn] of longint;
i,j,n:longint;
procedure create(k:longint);
var
m:longint;
begin
if tree[k].a<>tree[k].b then
begin
m:=(tree[k].a+tree[k].b) div 2;
tree[k*2].a:=tree[k].a;
tree[k*2].b:=m;
tree[k*2+1].a:=m+1;
tree[k*2+1].b:=tree[k].b;
create(k*2);
create(k*2+1);
end
else begin
tree[k].c:=1;
exit;
end;
tree[k].c:=tree[k*2].c+tree[k*2+1].c;
end;
procedure insert(k,p1,v1:longint);
var
m:longint;
begin
dec(tree[k].c);
if tree[k].a=tree[k].b then
begin
a[tree[k].a]:=v1;
exit;
end;
if p1<=tree[k*2].c
then insert(k*2,p1,v1)
else insert(k*2+1,p1-tree[k*2].c,v1);
end;
begin
while not eof do
begin
readln(n);
for i:=1 to n do
readln(p[i],v[i]);
tree[1].a:=1;
tree[1].b:=n;
create(1);
for i:=n downto 1 do
insert(1,p[i]+1,v[i]);
for i:=1 to n do
write(a[i],' ');
writeln;
end;
end.
- POJ2828 Buy Tickets 线段树
- POJ2828 Buy Tickets(线段树)
- POJ2828 Buy Tickets (线段树)
- poj2828 Buy Tickets线段树
- poj2828 Buy Tickets(线段树)
- 线段树 POJ2828 Buy Tickets
- 线段树--poj2828 Buy tickets
- POJ2828:Buy Tickets(线段树单点)
- poj2828 Buy Tickets 线段树,单点更新
- poj2828 Buy Tickets 线段树端点更新
- poj2828--Buy Tickets(线段树+详解)
- poj2828 Buy Tickets 单点更新线段树
- POJ2828 Buy Tickets 线段树单点更新
- poj2828 Buy Tickets (线段树)
- poj2828 Buy Tickets(线段树,单点更新)
- POJ2828 Buy Tickets(线段树)
- Poj2828 Buy Tickets 线段树、单点更新
- POJ2828:Buy Tickets(线段树)
- NS3编译错误 “STDOUT_FIFONO”未声明 解决方法
- java学习笔记(二十)java常用类
- FTP
- ACM做题过程中的一些小技巧
- 系统集成项目-管理工程师教程·一
- poj2828 Buy Tickets(线段树)
- axure的使用实例1
- C++中rand()函数的用法
- 201412-2 Z字形扫描
- Java-使用java mail技术发送电子邮件
- Web应用防护系统OpenWAF开源CC防护模块
- 编程练习4.25
- Spring 基于 Aspect 注解的增强实现
- centos 上为火狐浏览器安装flash 插件