POJ 2828 Buy Tickets【线段树单点更新+逆序遍历】【经典题】【模板题】
来源:互联网 发布:语音录入软件 编辑:程序博客网 时间:2024/05/16 12:31
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
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.
Source
#include<iostream>#include<algorithm>#include<cmath>#include<cstdio>#include<cstdlib>#include<queue>#include<map>#include<set>#include<stack>#include<bitset>#include<numeric>#include<vector>#include<string>#include<iterator>#include<cstring>#include<functional>#define INF 0x3f3f3f3f#define ms(a,b) memset(a,b,sizeof(a))using namespace std;const int maxn = 200000 + 10;const int mod = 1e9 + 7;const double pi = 3.14159265358979;typedef pair<int, int> P;typedef long long ll;typedef unsigned long long ull;int a[maxn << 2], seg[maxn];int p[maxn], v[maxn], n;void pushup(int re){a[re] = a[re << 1] + a[re << 1 | 1];}void build(int l, int r, int rt){if (l == r){a[rt] = 1;return;}int mid = (l + r) / 2;build(l, mid, rt << 1);build(mid + 1, r, rt << 1 | 1);pushup(rt);}int query(int ll, int rr, int l, int r, int rt){if (ll <= l&&r <= rr) return a[rt];int m = (l + r) >> 1;int ans = 0;if (ll <= m) ans += query(ll, rr, l, m, rt << 1);;if (rr > m) ans += query(ll, rr, m + 1, r, rt << 1 | 1);return ans;}void update(int p, int add, int l, int r, int rt){if (l == r){a[rt] = 0;seg[l] = add;return;}int m = (l + r) >> 1;if (p <= a[rt<<1]) update(p, add, l, m, rt << 1);else update(p-a[rt<<1], add, m + 1, r, rt << 1 | 1);pushup(rt);}int main(){while (~scanf("%d", &n)){build(1, n, 1);for (int i = 1; i <= n; i++){scanf("%d%d", p + i, v + i);}for (int i = n; i > 0; i--){update(p[i] + 1, v[i], 1, n, 1);}for (int i = 1; i <= n; i++){printf("%d ", seg[i]);}puts("");}return 0;}
- POJ 2828 Buy Tickets【线段树单点更新+逆序遍历】【经典题】【模板题】
- poj 2828 Buy Tickets 【线段树】【逆序插入 + 单点更新 + 区间求和】
- poj 2828POJ2828 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(线段树单点更新维护)
- POJ - 2828 Buy Tickets(线段树单点更新)
- POJ 题目2828 Buy Tickets(线段树单点更新)
- poj 2828 Buy Tickets(线段树-单点更新)
- POJ 2828 Buy Tickets(线段树--单点更新)
- poj 2828 Buy Tickets 线段树单点更新
- POJ3318:Matrix Multiplication(矩阵相乘)
- Splay基本操作和线段树(指针版)
- go在windows上环境搭建
- Node.js ORM框架Sequlize之表间关系
- 【Android_View】ImageView源码简析笔记(二)
- POJ 2828 Buy Tickets【线段树单点更新+逆序遍历】【经典题】【模板题】
- 如何访问函数内部的变量
- HDU 6082 度度熊与邪恶大魔王 DP
- 在CentOS 7 下安装.Net 框架
- Android 使用反射调用自定义AIDL **.Stub.asInterface(IBinder obj)、反射实现关机shutdown
- 机器学习:偏差、方差与欠拟合、过拟合
- 递归学习简单的小例子之hanoi塔问题
- gRPC 源码编译安装
- web前端入门积累