poj Buy Tickets 2828 (线段树) 好题

原创 2015年11月21日 11:31:39
Buy Tickets
Time Limit: 4000MS   Memory Limit: 65536K
Total Submissions: 16584   Accepted: 8268

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 ≤ iN). 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个人在火车站买票,由于天黑,所以你插队没人会看见,现在给出n个人的插队目标(允许自己前面有几个人),和他的价值(在这里没有用,只是在输出时用),让你求出n个人目标完成后,输出他们所对应的价值。

#include<stdio.h>
#include<string.h>
#include<algorithm>
#define N 200010
using namespace std;
struct zz
{
	int l;
	int r;
	int v;
	int p;
}q[N<<2];
struct z
{
	int p;
	int v;
}Q[N];
int dis[N];
int k;
void build(int gen,int l,int r)
{
	q[gen].l=l;
	q[gen].r=r;
	if(l==r)
	{
		q[gen].p=1;
		return ;
	}
	int mid=(l+r)/2;
	build(gen<<1,l,mid);
	build(gen<<1|1,mid+1,r);
	q[gen].p=q[gen<<1].p+q[gen<<1|1].p;
}
void update(int gen,int v,int p)
{
	if(q[gen].l==q[gen].r)
	{
		q[gen].v=v;
		q[gen].p=0;
		return ;
	}
	if(q[gen<<1].p>p)
		update(gen<<1,v,p);
	else
		update(gen<<1|1,v,p-q[gen<<1].p);
	q[gen].p=q[gen<<1].p+q[gen<<1|1].p;
}
void query(int gen)
{
	if(q[gen].l==q[gen].r)
	{
		dis[k++]=q[gen].v;
		return ;
	}
	query(gen<<1);
	query(gen<<1|1);
}
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		k=0;
		for(int i=0;i<n;i++)
			scanf("%d%d",&Q[i].p,&Q[i].v);
		build(1,1,n);
		for(int i=n-1;i>=0;i--)
			update(1,Q[i].v,Q[i].p);
		query(1);
		for(int i=0;i<n-1;i++)
			printf("%d ",dis[i]);
		printf("%d\n",dis[n-1]);
	}
	return 0;
}


 

相关文章推荐

POJ 2828 Buy Tickets【线段树单点更新+逆序遍历】【经典题】【模板题】

Buy Tickets Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 20782   A...
  • Archger
  • Archger
  • 2017年08月07日 20:21
  • 107

POJ 2828 Buy Tickets [线段树-单点更新]【数据结构】【好题】

POJ 2828 Buy Tickets 逆序操作+思维, 线段树好题

POJ 2828 Buy Tickets(神题!线段树or树状数组)

题目链接:POJ 2828 Buy Tickets
  • RaynX
  • RaynX
  • 2014年05月08日 16:03
  • 292

POJ 2828——Buy Tickets(树状数组,线段树——逆序遍历)

Buy Tickets Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 13496   A...

poj 2828 Buy Tickets -插队问题-单节点更新-线段树

Buy Tickets Railway tickets were difficult to buy around the Lunar New Year in China, so we must get...
  • ly59782
  • ly59782
  • 2016年11月11日 19:07
  • 256

POJ2828 Buy Tickets 【线段树】+【单点更新】+【逆序】

Buy Tickets Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 12296   A...

POJ 2828 Buy Tickets (线段树单点更新)

Buy Tickets Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 10957 Accepted: 5338 Descr...

poj 2828 Buy Tickets (线段树 单节点 查询位置更新)

Buy Tickets Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 15533   Accepted: 775...
  • lsgqjh
  • lsgqjh
  • 2015年07月25日 11:34
  • 575

poj 2828 Buy Tickets 线段树

题意/Description:     Railway tickets were difficult to buy around the Lunar New Year in China, so we...

POJ_2828_Buy Tickets_线段树、机智

void chedan(){ for(;;) puts("好困啊"); }
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:poj Buy Tickets 2828 (线段树) 好题
举报原因:
原因补充:

(最多只允许输入30个字)