Lost Cows_poj_2182(线段树).java
来源:互联网 发布:淘宝发布品牌不能为空 编辑:程序博客网 时间:2024/05/17 13:42
Lost Cows
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8312 Accepted: 5305
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//也可以不用线段树
import java.util.Scanner;public class Main {static Node[] tree;public static void main(String[] args) { Scanner input=new Scanner(System.in); while(input.hasNext()){ int n=input.nextInt(); tree=new Node[n*6]; Build(1,1,n); int[] a=new int[n+5]; double[] result=new double[n+5]; a[0]=0; for(int i=1;i<n;i++){ a[i]=input.nextInt(); } for(int i=n-1;i>=0;i--) result[i]=Query(1,a[i]+1); for(int i=0;i<n;i++) System.out.println(String.format("%.0f", result[i])); } }private static double Query(int p, int k) {tree[p].len--;if(tree[p].left == tree[p].right)return tree[p].left;int v=p<<1;if(tree[v].len>=k)return Query(v,k);elsereturn Query(v+1,k-tree[v].len);}private static void Build(int p, int left, int right) {tree[p]=new Node();tree[p].left=left;tree[p].right=right;tree[p].len=right-left+1;if(left==right)return;int mid=(left+right)>>1; int v=p<<1; Build(v,left,mid); Build(v+1,mid+1,right);}}class Node{int left;int right;int len;Node(){}}
- Lost Cows_poj_2182(线段树).java
- Lost Cows poj2182 线段树
- poj2182 Lost Cows (线段树)
- Lost Cows(线段树 POJ2182)
- poj2182 Lost Cows(线段树)
- POJ 2182 Lost Cows(线段树)
- 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 (线段树)
- POJ2182 Lost Cows 线段树单点更新
- poj 2182 Lost Cows 线段树
- 常见指针内存处理问题的详解
- Node.js的编译测试
- zoj 1715
- Android中AppWidget加载流程
- jmf不支持64位win7系统
- Lost Cows_poj_2182(线段树).java
- Service中Tomcat服务中无操作按钮,只有描述的解决方案
- opencv学习心得十----圆拟合
- 排序
- CSS实例(三):全部使用背景生成栏目
- Nginx源码解析
- 初来乍到,捣鼓捣鼓前端
- [Android] 直接获取组件的宽高:Activity.onWindowFocusChanged()
- hdu 题目1754 I Hate It (线段树,区间最大值)