POJ 2828 逆序插入加线段树
2016-06-20 21:50
357 查看
Buy Tickets
Time Limit: 4000MS Memory Limit: 65536K
Total Submissions: 17875 Accepted: 8852
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
4
0 77
1 51
1 33
2 69
4
0 20523
1 19243
1 3890
0 31492
Sample Output
77 33 69 51
31492 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.
Time Limit: 4000MS Memory Limit: 65536K
Total Submissions: 17875 Accepted: 8852
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
4
0 77
1 51
1 33
2 69
4
0 20523
1 19243
1 3890
0 31492
Sample Output
77 33 69 51
31492 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<vector> #include<algorithm> using namespace std; #define MAXN 210000 int seg[MAXN<<2],p[MAXN],a[MAXN],b[MAXN]; void build(int l,int r,int n){ if(l==r){ seg =1; return; } int mid=(l+r)>>1; build(l,mid,n<<1); build(mid+1,r,n<<1|1); seg =seg[n<<1]+seg[n<<1|1]; } void update(int p,int x,int l,int r,int n){ if(l==r){ seg --; b[l]=x; return ; } int mid=(l+r)>>1; if(seg[n<<1]>=p){ update(p,x,l,mid,n<<1); } else { update(p-seg[n<<1],x,mid+1,r,n<<1|1); } seg =seg[n<<1]+seg[n<<1|1]; } int main(){ int n; while(~scanf("%d",&n)){ build(1,n,1); for(int i=1;i<=n;i++){ scanf("%d%d",p+i,a+i); } for(int i=n;i>0;i--){ update(p[i]+1,a[i],1,n,1); } for(int i=1;i<=n;i++){ printf((i==1?"%d":" %d"),b[i]); } printf("\n"); } return 0; }
相关文章推荐
- jvm-GC
- numpy函数:tile函数
- 算法竞赛入门经典(第2版)习题1-4详解
- 替换空格
- linux shell取文本最后一行
- 字符串常量
- 8-141 类模版含有多个类型参数
- java 大家都知道斐波那契数列,现在要求输入一个整数n,请你输出斐波那契数列的第n项。斐波那契数列的定义如下
- 20150502管道、字符串
- 1001-专题四
- HDOJ 2544 最短路(四种做法)
- 什么是Intent(意图)
- Poj 2226 Muddy Fields【二分匹配】
- 关于软件开发团队的一些思考
- 【c++程序】不同字符的个数统计
- javascript之DOM操作
- 55. Jump Game
- libvlc 打开较大MP4文件,关闭慢的问题.
- ubuntu samba服务器的安装和出错修改
- 把自己的开源库添加cocoapods