• <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快速排序,然后統(tǒng)計y  , 時間效率是O(n^lgn)
            具體細節(jié)要自己體會,這題挺經典的.另外快速排序的方法,雖然我也不是第一次用到了,但是仍然不熟練,到網(wǎng)上查了語法再做的.
            #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最大,所以至少有一個猴王. 往前掃描,如果出現(xiàn)某個猴子的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

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

            posted on 2007-09-21 01:14 流牛ζ木馬 閱讀(1794) 評論(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+.   回復  更多評論   

            <2008年12月>
            30123456
            78910111213
            14151617181920
            21222324252627
            28293031123
            45678910

            導航

            統(tǒng)計

            公告

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

            常用鏈接

            留言簿(6)

            隨筆檔案

            相冊

            搜索

            最新隨筆

            最新評論

            閱讀排行榜

            評論排行榜

            国产精品久久毛片完整版| 久久久久久久久久久精品尤物| 亚洲国产精品无码久久久不卡| 日韩精品久久久肉伦网站| 国产三级观看久久| 午夜天堂av天堂久久久| 国产高潮国产高潮久久久| 亚洲精品乱码久久久久久蜜桃| 青青草国产精品久久久久| 亚洲精品无码成人片久久| av午夜福利一片免费看久久| 久久激情亚洲精品无码?V| 亚洲成人精品久久| 99精品久久精品| 热久久国产欧美一区二区精品| 国产美女久久精品香蕉69| 精品国产综合区久久久久久 | 亚洲色大成网站www久久九| 久久国产精品偷99| 久久这里都是精品| 亚洲国产综合久久天堂 | 中文字幕久久亚洲一区| a级成人毛片久久| 97精品国产97久久久久久免费 | 国产美女亚洲精品久久久综合| 国产精品久久久天天影视香蕉| 亚洲va久久久噜噜噜久久| 三级片免费观看久久| 精品999久久久久久中文字幕| 久久久久亚洲AV片无码下载蜜桃 | 久久精品国产亚洲AV无码偷窥| 久久国产福利免费| 久久国产精品久久国产精品| 亚洲AV日韩精品久久久久| 一级做a爰片久久毛片免费陪| 久久黄色视频| 久久一区二区三区免费| 久久青青色综合| 国产午夜电影久久| 国产—久久香蕉国产线看观看| 久久最近最新中文字幕大全|