题目链接:http://poj.org/problem?id=2828
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.
题意
n个人去排队,给出第 i 个人插到第 pos_i 个人后面,求最后的 val 顺序。
思路
pos[i]表示这个人当前想要插入的位置,如果原来pos[i]有人,那么原来pos[i]的人就去pos[i]+1位置,如果pos[i]+1有人,那么原来pos[i]+1的人就往后移一位……,每个人带有一个权值val[i],插完队后,依次输出每个人的权值。
逆向思考,最后一个人的位置一定是确定的,然后我们从后往前去安排每个人的位置,当安排 pos[i] 时,如果 pos[i] 有人,那么他自己就往后面移一位,直到有位置可以放为止。
线段树维护区间内能存放的空位数,对于要存放的pos,如果pos<=tree[k<<1].sum,说明左子树区间的空位大于等于pos,那么左子树区间一定可以放下它,否则,左子树区间放不下,先把左子树区间放满,再把 pos-tree[k<<1].sum 往右子树区间放。
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<ctype.h>
#include<vector>
#include<algorithm>
#include<sstream>
#define PI acos(-1.0)
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
const int inf = 0x3f3f3f3f;
const ll lnf = 0x3f3f3f3f3f3f3f3f;
const int maxn = 200100;
struct node{
int l,r;
int sum; //空位数
}tree[maxn<<2];
int ans[maxn];
int pos[maxn],val[maxn];
void pushup(int k)
{
tree[k].sum = tree[k<<1].sum + tree[k<<1|1].sum;
}
void build(int k,int l,int r)
{
tree[k].l = l,tree[k].r = r;
if(l==r){
tree[k].sum = 1;
return ;
}
int mid = (l+r)>>1;
build(k<<1,l,mid);
build(k<<1|1,mid+1,r);
pushup(k);
}
void change(int k,int x,int y)
{
if(tree[k].l==tree[k].r){
tree[k].sum = 0;
ans[tree[k].l] = y; //左子树区间的左端点插入
return ;
}
if(tree[k<<1].sum>=x) change(k<<1,x,y); //放在左子树区间
else change(k<<1|1,x-tree[k<<1].sum,y); //放在右子树区间
pushup(k);
}
int main(void)
{
int n;
while(~scanf("%d",&n)){
build(1,1,n);
for(int i=0;i<n;i++){
scanf("%d%d",&pos[i],&val[i]);
pos[i]++; //这里+1,题意是pos为 0 ~ n-1
}
for(int i=n-1;i>=0;i--){
change(1,pos[i],val[i]);
}
for(int i=1;i<=n;i++)
printf("%d ",ans[i]);
printf("\n");
}
return 0;
}