• <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(在這個(gè)數(shù)前面存在n個(gè)比這個(gè)數(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) 評(píng)論(0)  編輯 收藏 引用

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


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

            常用鏈接

            留言簿(8)

            隨筆檔案

            文章檔案

            Friends

            OJ

            搜索

            •  

            最新評(píng)論

            閱讀排行榜

            評(píng)論排行榜

            久久无码专区国产精品发布| 97视频久久久| 久久九色综合九色99伊人| 亚洲人成无码久久电影网站| 久久亚洲中文字幕精品有坂深雪| 久久精品国产一区| 日韩中文久久| 99久久精品国产麻豆| 久久国产精品免费| 99久久精品免费看国产一区二区三区| 久久久精品人妻一区二区三区蜜桃| 国产免费久久精品99久久| 国内精品久久久久影院薰衣草| 国产V亚洲V天堂无码久久久| 一级a性色生活片久久无| 狠狠色婷婷久久一区二区三区| 综合久久精品色| 久久精品国产69国产精品亚洲| 2020久久精品亚洲热综合一本| 热久久这里只有精品| 色综合久久无码中文字幕| 日本久久久久久久久久| 精品久久香蕉国产线看观看亚洲| 欧美精品国产综合久久| 久久亚洲国产成人影院网站| 天天爽天天爽天天片a久久网| 日本人妻丰满熟妇久久久久久| 一本久久综合亚洲鲁鲁五月天亚洲欧美一区二区 | 一级a性色生活片久久无| 国产成人精品久久亚洲| 久久九九亚洲精品| 99久久精品费精品国产一区二区 | 久久久久久久99精品免费观看| 日韩av无码久久精品免费| 欧美黑人激情性久久| 久久亚洲国产成人影院| 久久久黄片| 亚洲日韩欧美一区久久久久我| 色狠狠久久综合网| 中文字幕无码久久精品青草| 久久久这里有精品|