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

            ______________白白の屋
            posts - 182, comments - 102, trackbacks - 0, articles - 0
            <2010年9月>
            2930311234
            567891011
            12131415161718
            19202122232425
            262728293012
            3456789

            常用鏈接

            留言簿(24)

            隨筆分類(332)

            隨筆檔案(182)

            FRIENDS

            搜索

            積分與排名

            最新隨筆

            最新評論

            閱讀排行榜

            評論排行榜

            MiYu原創(chuàng), 轉(zhuǎn)帖請注明 : 轉(zhuǎn)載自 ______________白白の屋    

             

            題目地址:

                  http://acm.hdu.edu.cn/showproblem.php?pid=1800 

            題目描述:

            Problem Description

            In the year 8888, the Earth is ruled by the PPF Empire . As the population growing , PPF needs to find more land for the newborns . Finally , PPF decides to attack Kscinow who ruling the Mars . Here the problem comes! How can the soldiers reach the Mars ? PPF convokes his soldiers and asks for their suggestions . “Rush … ” one soldier answers. “Shut up ! Do I have to remind you that there isn’t any road to the Mars from here!” PPF replies. “Fly !” another answers. PPF smiles :“Clever guy ! Although we haven’t got wings , I can buy some magic broomsticks from HARRY POTTER to help you .” Now , it’s time to learn to fly on a broomstick ! we assume that one soldier has one level number indicating his degree. The soldier who has a higher level could teach the lower , that is to say the former’s level > the latter’s . But the lower can’t teach the higher. One soldier can have only one teacher at most , certainly , having no teacher is also legal. Similarly one soldier can have only one student at most while having no student is also possible. Teacher can teach his student on the same broomstick .Certainly , all the soldier must have practiced on the broomstick before they fly to the Mars! Magic broomstick is expensive !So , can you help PPF to calculate the minimum number of the broomstick needed .
            For example : 
            There are 5 soldiers (A B C D E)with level numbers : 2 4 5 6 4;
            One method :
            C could teach B; B could teach A; So , A B C are eligible to study on the same broomstick.
            D could teach E;So D E are eligible to study on the same broomstick;
            Using this method , we need 2 broomsticks.
            Another method:
            D could teach A; So A D are eligible to study on the same broomstick.
            C could teach B; So B C are eligible to study on the same broomstick.
            E with no teacher or student are eligible to study on one broomstick.
            Using the method ,we need 3 broomsticks.
            ……

            After checking up all possible method, we found that 2 is the minimum number of broomsticks needed. 
             

            Input
            Input file contains multiple test cases. 
            In a test case,the first line contains a single positive number N indicating the number of soldiers.(0<=N<=3000)
            Next N lines :There is only one nonnegative integer on each line , indicating the level number for each soldier.( less than 30 digits);
             

            Output
            For each case, output the minimum number of broomsticks on a single line.
             

            Sample Input
            4 10 20 30 04 5 2 3 4 3 4
             

            Sample Output
            1 2
             

            題目分析:

             

            相對來說這題用字典樹的效率比較高些.....遺憾的是我現(xiàn)在只會做一些字典樹的 水題....對字典樹的理解現(xiàn)在還不是很好......所以,呵呵

            這題我就直接篩選過了........

             

            代碼如下:

             /*

            MiYu原創(chuàng), 轉(zhuǎn)帖請注明 : 轉(zhuǎn)載自 ______________白白の屋

                      http://www.cnblog.com/MiYu

            Author By : MiYu

            Test      : 1

            Program   : 1800

            */


            #include <iostream>

            #include <algorithm>

            using namespace std;

            int num[3002];

            bool hash[3002];

            bool cmp ( const int &a, const  int &b )

            {

                 return a > b; 

            }

            int main ()

            {

                int N;

                while ( scanf ( "%d", &N ) != EOF )

                {

                       memset ( num, 0, 12008 );

                       memset ( hash, 0, 3002 );

                       for ( int i = 0; i != N; ++ i )

                             scanf ( "%d",num + i );

                       sort ( num, num + N, cmp );

                       int nCount = 0;

                       for ( int i = 0; i < N; ++ i )

                       {

                             if ( !hash[i] )

                             {

                                  nCount ++;

                                  int j = i ,k = j+1;

                                  hash[j] = true;

                                  while ( k < N ) 

                                  {

                                        if ( !hash[k] && num[k] < num[j] )

                                        {

                                             hash[k] = true;

                                             j = k;

                                        }

                                        k++;

                                  } 

                             }

                       } 

                       printf ( "%d\n",nCount );

                }

                return 0;

            }


             

             

            久久久久国产精品熟女影院| 要久久爱在线免费观看| 午夜精品久久久久久毛片| 久久精品无码一区二区WWW| 亚洲va国产va天堂va久久| 久久久久99精品成人片直播| 精品久久一区二区三区| 久久e热在这里只有国产中文精品99 | 精品久久久久久久中文字幕| 色婷婷久久久SWAG精品| 99麻豆久久久国产精品免费| 四虎国产精品成人免费久久| 亚洲综合伊人久久综合| 国産精品久久久久久久| 麻豆成人久久精品二区三区免费 | 2020最新久久久视精品爱 | 久久久久无码精品国产不卡| 国产精品成人99久久久久 | 日韩十八禁一区二区久久| 国产综合久久久久| 久久国产欧美日韩精品免费| 久久精品中文字幕久久| 国色天香久久久久久久小说| 久久久精品视频免费观看| 精品久久久噜噜噜久久久 | 亚洲精品无码专区久久同性男| 亚洲国产精品无码久久98| 亚洲国产精品综合久久一线| A级毛片无码久久精品免费| 国内精品久久久久久野外| av色综合久久天堂av色综合在| 精品久久久久久99人妻| 久久香蕉综合色一综合色88| 97久久久久人妻精品专区 | 久久久亚洲欧洲日产国码aⅴ | 久久婷婷是五月综合色狠狠| 91精品国产综合久久婷婷| 久久婷婷五月综合成人D啪| 日韩人妻无码精品久久免费一| 伊人久久大香线蕉无码麻豆| 久久综合狠狠综合久久97色|