zoukankan      html  css  js  c++  java
  • poj 2182 Lost Cows

    Lost Cows
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 9646   Accepted: 6207

    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
    

    Source

    敲一遍代码:

     1 #include<cstdio>
     2 #include<cmath>
     3 #include<cstring>
     4 #include<string>
     5 #include<algorithm>
     6 #include<iostream>
     7 #include<stack>
     8 using namespace std;
     9 #define size 8000
    10 struct Node{
    11     int l,r,snum;
    12 };
    13 Node node[size*4+5];
    14 int fir[size+5],brand[size+5];
    15 void build(int root,int l,int r){
    16     node[root].l=l;
    17     node[root].r=r;
    18     node[root].snum=r-l+1;
    19     if(l==r){
    20         return;
    21     }
    22     int mid=(l+r)/2;
    23     build(root*2,l,mid);
    24     build(root*2+1,mid+1,r);
    25 }
    26 int query(int root,int k){
    27     node[root].snum--;
    28     if(node[root].l==node[root].r){
    29         return node[root].l;
    30     }
    31     if(node[root*2].snum>=k){
    32         return query(root*2,k);//在根为root的树中可以使这个数成为第k个
    33     }
    34     else{
    35         return query(root*2+1,k-node[root*2].snum);
    36     }
    37 }
    38 int main(){
    39     //freopen("D:\INPUT.txt","r", stdin);
    40     int n;
    41     while(scanf("%d",&n)!=EOF){
    42         build(1,1,n);
    43         int i=2;
    44         fir[1]=0;
    45         for(;i<=n;i++) scanf("%d",&fir[i]);
    46         for(i=n;i>=1;i--){
    47             brand[i]=query(1,fir[i]+1);
    48         }
    49         for(i=1;i<=n;i++){
    50             cout<<brand[i]<<endl;
    51         }
    52     }
    53     return 0;
    54 }
  • 相关阅读:
    java线程池实践
    JAVA中间件(middleware)模式
    [开源]制作docker镜像不依赖linux和Docker环境
    利用浏览器favicon的缓存机制(F-Cache)生成客户端浏览器唯一指纹
    Docker镜像构建原理解析(不装docker也能构建镜像)
    ORM框架对分表分库之分库和分表指定不同的字段
    volatile的内存屏障的坑
    go和python的比较,获取当前时间是今年第几个星期
    c++学生管理系统
    c++学生管理系统(三)
  • 原文地址:https://www.cnblogs.com/Deribs4/p/4374717.html
Copyright © 2011-2022 走看看