• <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>

            ACM PKU 1828 Monkeys' Pride

            http://acm.pku.edu.cn/JudgeOnline/problem?id=1828
            看了discuss,很多同學對題意理解有誤(剛開始我也理解錯了)
            主要是這句:If a monkey lives at the point (x0, y0), he can be the king only if there is no monkey living at such point (x, y) that x>=x0 and y>=y0

            成為猴王的條件是,沒有任何的一個猴子的x坐標和y坐標都大于它,而不是說猴王的x和y都要最大.
            ok,算法也出來了,簡單地說: 先對x快速排序,然后統計y  , 時間效率是O(n^lgn)
            具體細節要自己體會,這題挺經典的.另外快速排序的方法,雖然我也不是第一次用到了,但是仍然不熟練,到網上查了語法再做的.
            #include"stdio.h"
            #include
            "stdlib.h"

             
             typedef 
            struct{
                
            int x;
                 
            int y;
             }
            node[50001];
             


             
            int cmp(const void *pl, const void *pr){   ///按照x從小到大排序
                node *p1 = (node*)pl; 
                 node 
            *p2 = (node*)pr;
                 
            if(p1->== p2->x)           
                     
            return p1->- p2->y;
                
            return p1->- p2->x;
             }

             

            void main(){
                 
            int num,i,total,maxy;
                 
            while(scanf("%d",&num) && num){
                     
            for(i=0;i<num;i++)
                         scanf(
            "%d%d",&nodes[i].x,&nodes[i].y);
                     qsort(nodes, num, 
            sizeof(node), &cmp); //按照x從小到大排序
                   total=1;           //最后一個猴子的x最大,所以至少有一個猴王. 往前掃描,如果出現某個猴子的y大于當前最大y,total+1
                     maxy=nodes[num-1].y;
                    
            for(i=num-2;i>=0;i--){
                         
            if(maxy<nodes[i].y){
                            maxy
            =nodes[i].y;
                             total
            ++;
                         }

                     }

                     printf(
            "%d\n",total);
                 }

                 
            return;
             }



            另外,在PKU上編譯器效率的問題:

            同樣的程序,我測試了3次.
            include的時候,如果用iostream,在  C++編譯器下測試,Memory是476K ,時間280MS
            換成 stdio.h + stdlib.h ,在C編譯器下Memory是464K ,時間171MS
            如果是stdio.h + stdlib.h在C++的編譯器下測試呢?Memory是464K ,時間155MS

            也就是說,同樣的測試數據,要達到最好的效率,應該用純C的方式寫程序,并選擇C++編譯器judge程序.

            posted on 2007-09-21 01:14 流牛ζ木馬 閱讀(1793) 評論(8)  編輯 收藏 引用

            評論

            # re: ACM PKU 1828 Monkeys' Pride 2008-12-02 18:12 aa

            這題題目改了吧。。。你這代碼過不了。  回復  更多評論   

            # re: ACM PKU 1828 Monkeys' Pride 2009-08-01 09:33 幻風

            明顯過不了吧?
            4
            3 1
            3 2
            3 0
            2 2
              回復  更多評論   

            # re: ACM PKU 1828 Monkeys' Pride 2010-07-09 00:15 WallacePatti29

            This is what I was exploring for a while! Thank you for this topic around college! Once someone state that In union there is might. Our high qualified team can help you in writing <a href="http://essaysexperts.com/">term paper</a>.  回復  更多評論   

            # re: ACM PKU 1828 Monkeys' Pride 2010-07-09 16:43 dissertation writing service

            Your well done article about this post comes side by side with the student dissertation. Hence, you must perform for dissertation service.   回復  更多評論   

            # re: ACM PKU 1828 Monkeys' Pride 2010-07-09 17:29 thesis

            Eventually, We have found best article just about this good post? We suggest to search the buy thesis or purchase french dissertation, just because this helps in getting the best grade if you have buy dissertation.   回復  更多評論   

            # re: ACM PKU 1828 Monkeys' Pride 2010-09-06 14:54 resume writing service

            The clients rely on our
            resume service cause they are very responsible! This corporation performs resume writing to fit the precise field of science you wish.  回復  更多評論   

            # re: ACM PKU 1828 Monkeys' Pride 2010-10-07 14:55 buying essays

            To have good grades, some students have to decide if they are willing to accomplish the custom essay paper online or buy an essay paper of the best upper-class.   回復  更多評論   

            # re: ACM PKU 1828 Monkeys' Pride 2012-01-13 07:40 book reports

            University students would not have complications with their wars essays creating, because the papers writing corporations are able to sell essay of high quality.   回復  更多評論   

            # re: ACM PKU 1828 Monkeys' Pride 2012-04-17 19:04 buy essay

            Some time before I faced a lot of complications with essays writing. Nevertheles, my friend suggested to buy essays online. Thus, at this moment I have my A+.   回復  更多評論   

            <2007年9月>
            2627282930311
            2345678
            9101112131415
            16171819202122
            23242526272829
            30123456

            導航

            統計

            公告

            MY Email/MSN :mars1021@163.com QQ : 27402040 流牛ζ木馬

            常用鏈接

            留言簿(6)

            隨筆檔案

            相冊

            搜索

            最新隨筆

            最新評論

            閱讀排行榜

            評論排行榜

            精品久久久久久国产三级| 国产精品久久国产精麻豆99网站| 中文字幕亚洲综合久久2| 精品国产综合区久久久久久| 久久伊人色| 久久久久久久97| 武侠古典久久婷婷狼人伊人| 久久精品欧美日韩精品| 久久九色综合九色99伊人| 国产亚洲精久久久久久无码77777| 狠狠色婷婷久久一区二区三区| 2020最新久久久视精品爱| 亚洲AV无一区二区三区久久 | 国产视频久久| 欧美大战日韩91综合一区婷婷久久青草 | 久久久久久午夜精品| 国产亚洲色婷婷久久99精品| 久久亚洲av无码精品浪潮| 久久精品国产亚洲av日韩| 久久综合九色综合欧美就去吻| 国内精品久久久久久99| 久久精品国产久精国产一老狼| 94久久国产乱子伦精品免费| 午夜精品久久久久久久| 三级三级久久三级久久| 久久99精品久久久久久不卡| 国产精品青草久久久久婷婷| 欧美午夜精品久久久久免费视 | 久久久精品人妻一区二区三区四 | 日韩中文久久| 久久996热精品xxxx| 日本精品久久久久中文字幕8 | 久久婷婷五月综合97色直播| 久久美女网站免费| 国产精品久久成人影院| 91精品国产91热久久久久福利 | 久久www免费人成看国产片| 国产成人AV综合久久| 88久久精品无码一区二区毛片| 国产精品免费看久久久香蕉| 国产精品一区二区久久精品无码|