• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            posts - 74,  comments - 33,  trackbacks - 0
            Lost Cows
            Time Limit: 1000MS Memory Limit: 65536K
            Total Submissions: 2992 Accepted: 1864

            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
            題目大意是根據(jù)所給的數(shù)n(在這個數(shù)前面存在n個比這個數(shù)小的),求出原數(shù)列;
            構(gòu)造線段樹的代碼如下
            #include<malloc.h>
            struct?node{
            ????
            int?l,r;
            ????
            int?len;
            ????node?
            *lchild,*rchild;????
            }
            Segment_Tree;
            void?Build(node*?now,int?l,int?r){
            ????now
            ->l=l;
            ????now
            ->r=r;
            ????now
            ->len=r-l+1;
            ????
            if(r>l){
            ????????
            int?mid=(l+r)>>1;
            ????????now
            ->lchild=(node*)malloc(sizeof(node));
            ????????now
            ->rchild=(node*)malloc(sizeof(node));
            ????????Build(now
            ->lchild,l,mid);
            ????????Build(now
            ->rchild,mid+1,r);????
            ????}

            ????
            return?;
            }

            int?FindNum(node*?now,int?num){
            ????now
            ->len--;
            ????
            if(now->l==now->r)
            ????????
            return?now->l;
            ????
            else?if((now->lchild)->len>=num)
            ????????
            return?????FindNum(now->lchild,num);
            ????
            else?return?FindNum(now->rchild,num-((now->lchild)->len));
            }
            posted on 2009-02-19 08:44 KNIGHT 閱讀(415) 評論(0)  編輯 收藏 引用

            只有注冊用戶登錄后才能發(fā)表評論。
            網(wǎng)站導(dǎo)航: 博客園   IT新聞   BlogJava   博問   Chat2DB   管理


            <2009年2月>
            25262728293031
            1234567
            891011121314
            15161718192021
            22232425262728
            1234567

            常用鏈接

            留言簿(8)

            隨筆檔案

            文章檔案

            Friends

            OJ

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            国产精品一区二区久久不卡| 久久中文字幕视频、最近更新| 婷婷久久综合| 亚洲AV无码久久精品蜜桃| 欧美va久久久噜噜噜久久| 色综合久久精品中文字幕首页| 精品国产综合区久久久久久 | 一本色道久久99一综合| 久久久噜噜噜www成人网| 久久久久成人精品无码| 久久婷婷五月综合国产尤物app| 久久天堂AV综合合色蜜桃网| 狠狠人妻久久久久久综合蜜桃| 要久久爱在线免费观看| 久久久WWW成人| 香蕉99久久国产综合精品宅男自 | 77777亚洲午夜久久多人| 免费国产99久久久香蕉| 亚洲精品乱码久久久久久按摩 | 狠狠色伊人久久精品综合网 | 亚洲综合日韩久久成人AV| 国产成人精品久久一区二区三区av | 久久婷婷人人澡人人| 99久久国产综合精品麻豆| 亚洲成色WWW久久网站| 久久亚洲av无码精品浪潮| 国产精品一区二区久久精品| 伊人久久大香线蕉综合Av| 久久久久九九精品影院| 香蕉久久夜色精品国产小说| 91精品国产综合久久香蕉 | 国产精品久久久久久久久鸭 | 国内精品久久久人妻中文字幕| 亚洲欧洲精品成人久久奇米网| 亚洲一本综合久久| 青青青国产精品国产精品久久久久| 久久无码人妻一区二区三区| 无码八A片人妻少妇久久| 久久天天躁狠狠躁夜夜2020一| 狠狠综合久久AV一区二区三区| 亚洲第一永久AV网站久久精品男人的天堂AV |