poj 2828 Buy Tickets(树状数组找部分和为k的第一个位置)
来源:互联网 发布:他改变了中国知乎 编辑:程序博客网 时间:2024/06/04 20:03
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 nextN lines contain the pairs of values Posi and Vali in the increasing order ofi (1 ≤ i ≤ N). For each i, the ranges and meanings ofPosi and Vali are as follows:
- Posi ∈ [0, i − 1] — The i-th person came to the queue and stood right behind thePosi-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 valueVali.
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.
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <queue>#include <stack>#include <vector>#include <map>#include <cmath>#include <cstdlib>#define L(rt) (rt<<1)#define R(rt) (rt<<1|1)#define ll __int64#define eps 1e-6using namespace std;const int INF = 1000000007;const int maxn = 200005;int c[maxn], pos[maxn], id[maxn];int n;int lowbit(int x){ return x & (-x);}int find(int k){ int mod = 0, ans = 0; for(int i = 18; i >= 0; i--) { ans += (1 << i); if(ans >= n || mod + c[ans] >= k) ans -= (1 << i); else mod += c[ans]; } return ans + 1;}void add(int x){ for(int i = x; i < maxn; i+= lowbit(i)) c[i]--;}int main(){ int ans[maxn]; while(~scanf("%d", &n)) { memset(c, 0, sizeof(c)); for(int i = 1; i <= n; i++) { c[i] = lowbit(i); scanf("%d%d", &pos[i], &id[i]); pos[i]++; } for(int i = n; i >= 1; i--) { int t = find(pos[i]); ans[t] = id[i]; add(t); } for(int i = 1; i < n; i++) printf("%d ", ans[i]); printf("%d\n", ans[n]); } return 0;}
- poj 2828 Buy Tickets(树状数组找部分和为k的第一个位置)
- POJ 2828 poj 2828 Buy Tickets 【树状数组,已知前n项和为K,返回n值】
- POJ 2828 Buy Tickets(树状数组)
- POJ 2828 Buy Tickets(树状数组)
- (POJ2828)Buy Tickets <树状数组 | 线段树> 找第k空位
- poj 2828 -- Buy Tickets ( 线段树 / 树状数组 )
- 【poj 2828】 Buy Tickets(线段树/树状数组)
- POJ 2828 Buy Tickets (树状数组 or 线段树)
- poj 2828 Buy Tickets(树状数组 | 线段树)
- POJ - 2828 - Buy Tickets(线段树-单点更新找位置)
- POJ 2828 Buy Tickets(神题!线段树or树状数组)
- POJ 2828——Buy Tickets(树状数组,线段树——逆序遍历)
- 线段树寻找部分和为k的第一个位置
- POJ 2828(Buy Tickets)
- poj 2828 Buy Tickets(线段树 区间和的应用)
- poj 2828 Buy Tickets
- poj 2828 Buy Tickets
- poj 2828 Buy Tickets
- hdu 1027
- 鼠标拖动添加指北针,鼠标拖动的范围为指北针的范围
- unity3d 中文教程教你unity3d 的替换效果
- xcode工程名修改
- C++内部类
- poj 2828 Buy Tickets(树状数组找部分和为k的第一个位置)
- 11-20代码
- 傻瓜式IOS发布教程(一)iTunes Connect创建应用以及内购
- 第一次写博客
- java 动态代理深度学习(Proxy,InvocationHandler),含$Proxy0源码(转)
- 【Oracle】Oracle-Linux下导出、导入数据库命令实现(三)
- struts2自学笔记一(HelloWorld)
- 时间戳服务
- Oracle 通用补丁安装操作手册