• <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) 評論(0)  編輯 收藏 引用
            <2025年7月>
            293012345
            6789101112
            13141516171819
            20212223242526
            272829303112
            3456789

            常用鏈接

            留言簿(8)

            隨筆檔案

            文章檔案

            Friends

            OJ

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            久久亚洲国产欧洲精品一| 99久久无码一区人妻| 亚洲国产天堂久久综合| 欧美精品国产综合久久| 人妻无码αv中文字幕久久琪琪布| 无码超乳爆乳中文字幕久久| 狠狠88综合久久久久综合网| 99久久精品免费| 色99久久久久高潮综合影院| 久久热这里只有精品在线观看| 久久精品国产亚洲AV嫖农村妇女| 青青青伊人色综合久久| 香蕉久久久久久狠狠色| 99久久99这里只有免费费精品| 国产精品久久久久久久久久影院| 欧美日韩精品久久免费| 国产精品禁18久久久夂久| 国内精品久久久久影院网站 | 午夜天堂精品久久久久| 国产美女久久精品香蕉69| 久久久精品人妻无码专区不卡| 亚洲AV无码久久精品色欲| 国产精品午夜久久| 久久国产亚洲高清观看| 人妻无码精品久久亚瑟影视 | 久久综合亚洲色HEZYO国产| 久久久噜噜噜久久中文字幕色伊伊| 狠狠色噜噜狠狠狠狠狠色综合久久| 久久人妻无码中文字幕| 久久久久97国产精华液好用吗| 久久国产精品无码一区二区三区| 亚洲AⅤ优女AV综合久久久| 久久精品嫩草影院| 狠狠色丁香久久婷婷综合五月| 久久天天躁夜夜躁狠狠| 久久93精品国产91久久综合| 国产精品久久久久国产A级| 精品无码久久久久国产动漫3d| 综合久久一区二区三区 | 日产精品99久久久久久| 一本久久综合亚洲鲁鲁五月天亚洲欧美一区二区 |