poj2182 Lost Cows-线段树

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, NLines 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

题目大意：
有编号1-n的n个数字，2<=n<=8000,乱序排列，排序是未知的。对于每个位置的数字，知道排在它前面比它小的数字有多少个。求这个乱序数列的顺序。

解题关键：
在剩下的编号中，第pre[n]+1个数字就是ans[n]

代码如下：

#include <iostream>
using namespace std;
const int N = 10010;
int ans[N];
int pre[N];struct node {int l, r;int len;
} tree[4 * N];void build(int l, int r, int u) {tree[u].l = l;tree[u].r = r;if (l == r) {tree[u].len = l - r + 1;
//      cout << u << " - " << tree[u].len << endl;return;}int mid = (l + r) >> 1;build(l, mid, 2 * u);build(mid + 1, r, 2 * u + 1);tree[u].len = tree[2 * u].len + tree[2 * u + 1].len;
//  cout << u << " - " << tree[u].len << endl;
}int query(int u, int num) {tree[u].len--;if (tree[u].l == tree[u].r)return tree[u].l;if (tree[2 * u].len < num) {return query(2 * u + 1, num - tree[2 * u].len);}if (tree[2 * u].len >= num) {return query(2 * u, num);}
}int main() {int n, i;cin >> n;pre[1] = 0;for (int i = 2; i <= n; i++)cin >> pre[i];build(1, n, 1);
//  for (int i = 1; i <= n; i++)
//      cout << tree[i].len << " ";
//  cout << endl;for (int i = n; i >= 1; i--) {ans[i] = query(1, pre[i] + 1);}for (int i = 1; i <= n; i++)cout << ans[i] << endl;
//  cout << endl;return 0;
}

poj2182 Lost Cows-线段树相关推荐

POJ2182 Lost Cows（树状数组、二分、倍增）
Lost Cows 题目链接 Description N (2 <= N <= 8,000) cows have unique brands in the range 1-N. In a ...
POJ2182 HDU2711 Lost Cows【树状数组+线段树】
Lost Cows Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 17113 Accepted: 10664 Descripti ...
线段树-Difficult Lost Cows
总时间限制: 2000ms 单个测试点时间限制: 1000ms 内存限制: 65536kB 描述 N (2 <= N <= 100,000) cows have unique brands ...
POJ - 2182 Lost Cows【线段树】
题目链接首先,题意比较清楚,给你n-1个数,表示从2到n,其中ai表示编号为i头牛所处位置的前面有几个的序号比他小.通过这些数据,让你输出这些牛的排列顺序. 思路: 对于最后的一头牛,他肯定是(an ...
线段树(Segment Tree)
1.概述线段树,也叫区间树,是一个完全二叉树,它在各个节点保存一条线段(即"子数组"),因而常用于解决数列维护问题,基本能保证每个操作的复杂度为O(lgN). 线段树是一种二叉搜 ...
【BZOJ】1672: [Usaco2005 Dec]Cleaning Shifts 清理牛棚（dp/线段树）
http://www.lydsy.com/JudgeOnline/problem.php?id=1672 dp很好想,但是是n^2的..但是可以水过..(5s啊..) 按左端点排序后 f[i]表示取第 ...
洛谷P2826 [USACO08NOV]光开关Light Switching [2017年6月计划线段树02]
P2826 [USACO08NOV]光开关Light Switching 题目描述 Farmer John tries to keep the cows sharp by letting them p ...
poj 3264 Balanced Lineup RMQ问题线段树
For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One d ...
POJ 3264 Balanced Lineup【线段树区间查询求最大值和最小值】
Balanced Lineup Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 53703 Accepted: 25237 ...
POJ 3264 Balanced Lineup 【线段树】
Balanced Lineup Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 50004 Accepted: 23434 Cas ...

poj2182 Lost Cows-线段树

poj2182 Lost Cows-线段树相关推荐

最新文章

热门文章