poj 2182 Lost Cows
来源:互联网 发布:淘宝食品代理公司注 编辑:程序博客网 时间:2024/04/30 05:51
Lost Cows
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8260 Accepted: 5269
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.
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.
* 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
51210
Sample Output
24531
Source
hpu张燚
import java.util.LinkedList;import java.util.Scanner;import java.util.Stack;public class Main{/* * 大概意思:有N头牛,编号1--N,他不知道每头牛的固定位置,他只知道 * 前边有几个比这个位置牛的编号小的牛,求各个牛的位置,输出其编号 */public static void main(String[] args) {Scanner input=new Scanner(System.in);while(input.hasNext()){int n=input.nextInt();LinkedList<Integer> list=new LinkedList<Integer>();for(int i=1;i<=n;i++)list.add(i);Stack<Integer> s1=new Stack<Integer>();while(--n>0)s1.add(input.nextInt());Stack<Integer> s=new Stack<Integer>();while(!s1.isEmpty()){int a=s1.pop();s.push(list.remove(a));}System.out.println(list.getFirst());while(!s.isEmpty())System.out.println(s.pop());}}}
- 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
- poj 2182 Lost Cows
- POJ 2182 Lost Cows
- poj 2182 Lost Cows
- OpenCV 2 遇到问题汇总
- Java Atomic的使用总结
- 字符数组排序(用指针数组实现)
- PowerShell命令cmdlet大全
- java编程思想笔记--内部类部分二
- poj 2182 Lost Cows
- IOS开发之带格式的文本
- Jquery UI 组合树 - ComboTree 集成Wabacus4.1 代码剖析
- android 取消蓝牙配对框 实现自动配对
- opengl——开篇掉坑里了
- Andrew Stankevich's Contest #5 Solution
- delphi中响应鼠标进入或离开控件的方法
- 报错: java.security.KeyStoreException: java.security.NoSuchAlgorithmException: KeyStore jks implementa
- MPEG-2文件的构造格式