【POJ 2182 Lost Cows】+ 线段树
来源:互联网 发布:cms绑定域名 编辑:程序博客网 时间:2024/05/17 23:54
Lost Cows
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 11336 Accepted: 7301
Description
N (2 <= N <= 8,000) cows have unique brands in the range 1..N. In a spectacular display of poor judgment, they visited the neighborhood ‘watering hole’ and drank a few too many beers before dinner. When it was time to line up for their evening meal, they did not line up in the required ascending numerical order of their brands.
Regrettably, FJ does not have a way to sort them. Furthermore, he’s not very good at observing problems. Instead of writing down each cow’s brand, he determined a rather silly statistic: For each cow in line, he knows the number of cows that precede that cow in line that do, in fact, have smaller brands than that cow.
Given this data, tell FJ the exact ordering of the cows.
Input
* Line 1: A single integer, N
- Lines 2..N: These N-1 lines describe the number of cows that precede a given cow in line and have brands smaller than that cow. Of course, no cows precede the first cow in line, so she is not listed. Line 2 of the input describes the number of preceding cows whose brands are smaller than the cow in slot #2; line 3 describes the number of preceding cows whose brands are smaller than the cow in slot #3; and so on.
Output
* Lines 1..N: Each of the N lines of output tells the brand of a cow in line. Line #1 of the output tells the brand of the first cow in line; line 2 tells the brand of the second cow; and so on.
Sample Input
5
1
2
1
0
Sample Output
2
4
5
3
1
建树 + 查询·~~
AC代码 :
#include<cstdio>#include<algorithm>using namespace std;const int MAXN = 8010;struct node{ int l,r,x;}st[MAXN * 3];int pa[MAXN],ma[MAXN];void Built(int l,int r,int u){ // 建树 st[u].l = l; st[u].r = r; st[u].x = r - l + 1; if(l == r) return ; Built(l,(l + r) >> 1 , u << 1); Built(((l + r) >> 1) + 1,r, (u << 1) + 1);}int qu(int v,int u){ st[v].x--; if(st[v].l == st[v].r) return st[v].l; if(st[v << 1].x < u) return qu((v << 1) + 1, u - st[v << 1].x); if(st[v << 1].x >= u) return qu(v << 1,u);}int main(){ int n; scanf("%d",&n); pa[1] = 0; for(int i = 2 ; i <= n ; i++) scanf("%d",&pa[i]); Built(1,n,1); for(int i = n ; i >= 1 ; i--) ma[i] = qu(1,pa[i] + 1); for(int i = 1 ; i <= n; i++) printf("%d\n",ma[i]); return 0;}
- POJ 2182 Lost Cows(线段树)
- POJ 2182 Lost Cows 线段树
- poj 2182 Lost Cows 线段树!!!!
- poj-2182-Lost Cows(线段树)
- poj 2182 Lost Cows (线段树)
- POJ 2182 Lost Cows.(线段树)
- poj 2182 :Lost Cows (线段树)
- POJ 2182 Lost Cows 线段树
- 【POJ】 2182 - Lost Cows 【线段树入门】
- POJ - 2182 - Lost Cows (线段树)
- poj 2182 Lost Cows 线段树
- 【POJ 2182 Lost Cows】+ 线段树
- POJ - 2182 Lost Cows【线段树】
- Poj 2182 Lost Cows 线段树
- POJ 2182 Lost Cows 线段树 or 树状数组
- poj 2182 Lost Cows 线段树
- POJ 2182 Lost Cows (树状数组 or 线段树)
- 线段树单点更新 poj 2182 Lost Cows
- git学习-使用ssh
- 2.centos下搭建lamp环境
- 最长公共子串
- 使程序在后台执行,并将日志输出至文件
- 7种排序算法
- 【POJ 2182 Lost Cows】+ 线段树
- HDU 2504
- Hibernate5.2.4环境搭建
- 平衡二叉树
- Tips
- java 内存泄漏
- Toolbar的使用
- git学习-上传项目
- 协会批判日记