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

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

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

代码如下：

#include <iostream>
using namespace std;
const int N = 8010;
int ans[N], pre[N], num[N];int main() {int n;cin >> n;for (int i = 1; i <= n; i++)num[i] = i;pre[1] = 0;for (int i = 2; i <= n; i++)cin >> pre[i];int k;for (int i = n; i >= 1; i--) {k = 0;for (int j = 1; j <= n; j++) {if (num[j] != -1)k++;if (k == pre[i] + 1) {ans[i] = num[j];num[j] = -1;break;}}}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 ...
线段树(Segment Tree)
1.概述线段树,也叫区间树,是一个完全二叉树,它在各个节点保存一条线段(即"子数组"),因而常用于解决数列维护问题,基本能保证每个操作的复杂度为O(lgN). 线段树是一种二叉搜 ...
POJ2182 HDU2711 Lost Cows【树状数组+线段树】
Lost Cows Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 17113 Accepted: 10664 Descripti ...
[USACO13NOV]Crowded Cows【暴力枚举】
Pro Luogu3088 Sol 把所有牛的身高按照高度排序方便剪枝.从大到小枚举,如果枚举的这个点满足在范围内且是它的二倍的话,flagflagflag标记一下,记住一定要两个标记,因为范围是两边 ...
hdu4277 暴力
hdu4277 暴力 USACO ORZ Time Limit : 5000/1500ms (Java/Other) Memory Limit : 32768/32768K (Java/Oth ...
bzoj 3383: [Usaco2004 Open]Cave Cows 4 洞穴里的牛之四（set+BFS）
3383: [Usaco2004 Open]Cave Cows 4 洞穴里的牛之四 Time Limit: 1 Sec Memory Limit: 128 MB Submit: 44 Solved ...
bzoj 1675: [Usaco2005 Feb]Rigging the Bovine Election 竞选划区（暴力）
1675: [Usaco2005 Feb]Rigging the Bovine Election 竞选划区 Time Limit: 5 Sec Memory Limit: 64 MB Submit: ...
bzoj 1648: [Usaco2006 Dec]Cow Picnic 奶牛野餐（暴力DFS）
1648: [Usaco2006 Dec]Cow Picnic 奶牛野餐 Time Limit: 5 Sec Memory Limit: 64 MB Submit: 774 Solved: 480 ...
Corral the Cows（二分、前缀和、离散化）
题面:Corral the Cows[牛客] 题目大意有 nnn 个单位的三叶草,每单位三叶草占据一个 1×11×11×1 的土地,每块土地的位置由其左下角的下标确定,并且下标 xxx 和 yyy ...
NFLS OJ 1162 暴力
逃离农场时间限制:1s 内存限制:64M 问题描述奶牛们正策划一个大胆的逃离农夫John魔掌的计划.它们设法获得了一艘小型充气艇,在夜幕降临时,一队奶牛将会登艇渡过到农场边小河的对岸.这个计划看 ...

poj2182 Lost Cows-暴力

poj2182 Lost Cows-暴力相关推荐

最新文章

热门文章