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

            }


             

             

            色婷婷综合久久久久中文字幕| 亚洲精品国产第一综合99久久| 2021国产精品久久精品| 久久国产午夜精品一区二区三区| 久久国产亚洲精品麻豆| 日本精品久久久中文字幕| 一本大道久久a久久精品综合| 久久99精品国产99久久| 51久久夜色精品国产| 久久精品国产亚洲5555| 热综合一本伊人久久精品| 久久久久亚洲爆乳少妇无| 国产成人综合久久精品红| 一本色道久久HEZYO无码| 熟妇人妻久久中文字幕| 久久国产成人精品麻豆| 久久精品国产一区二区三区不卡 | 91精品国产91热久久久久福利| 国产精品久久自在自线观看| 国产精品久久久久乳精品爆| 狠狠色丁香久久婷婷综合图片| 人妻精品久久久久中文字幕69 | 91久久精品91久久性色| 999久久久国产精品| 久久人与动人物a级毛片| 国产精品美女久久久久| 久久午夜综合久久| 久久国产精品77777| 久久香蕉国产线看观看猫咪?v| 日产精品99久久久久久| 久久精品国产精品亚洲| 久久精品中文无码资源站| 日韩欧美亚洲综合久久影院Ds| 亚洲AV成人无码久久精品老人| 久久精品国产亚洲av瑜伽| 久久久久国产精品熟女影院| 亚洲精品国产自在久久| 婷婷综合久久中文字幕| 欧美喷潮久久久XXXXx| 开心久久婷婷综合中文字幕| 久久96国产精品久久久|