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

            oyjpArt ACM/ICPC算法程序設計空間

            // I am new in programming, welcome to my blog
            I am oyjpart(alpc12, 四城)
            posts - 224, comments - 694, trackbacks - 0, articles - 6
            前面做的那道Bridging?Signals是有技巧性的題目 因為題目要求o(n*logn)的復雜度
            剛才又做了一道The Tower of Babylon 題目不難 但是堪稱經典啦

            簡述: 有N種石頭(每種數量無限)題目給出每種的長寬高 先要求將其按底面積遞減的順序從下往上堆(注意是嚴格遞減 對應邊相等不算) 問最多可以堆多高?

            分析:首先我想的是處理底面積的時候可能要分情況討論,但是比較復雜。于是干脆將每塊石頭變成3塊(這樣就可以得到石頭的真正總數了)。block代表所有石頭 有3個成員x,y,z.

            ?然后將其按照底面積大小從大到小排序。建立一個數組h[],h[i]記錄的是當前石頭作為頂上石頭時候的總高度。于是狀態轉移方程為 h[i] = max {h[j]+block[i].z)。輸出最大的height[i]就可以了

            呵呵 做完之后不知怎么覺得好爽啊~~

            Feedback

            # re: 今天我做的一道經典動歸題The Tower of Babylon   回復  更多評論   

            2006-08-09 08:57 by cmdn
            很羨慕你的說,大學里能夠這么有耐心的研究算法。我一直在考慮我能夠在計算機領域內發展到什么層次?恐怕這些我不感興趣的算法以后會成為我很大的阻礙阿 !

            # re: 今天我做的一道經典動歸題The Tower of Babylon   回復  更多評論   

            2006-08-09 11:03 by sicheng
            是自從接觸ACM以來才知道自己原來水平有多菜~~(呵呵) 后來才知道原來自己與別人的差距有多大啊~~ 從最簡單的算法開始認認真真學 爭取早日走出菜鳥的圈圈

            # re: 今天我做的一道經典動歸題The Tower of Babylon   回復  更多評論   

            2006-08-09 18:14 by SoRoMan
            感覺就是個插入排序問題,其插入排序實現見http://m.shnenglu.com/SoRoMan/archive/2006/08/09/11053.html

            # re: 今天我做的一道經典動歸題The Tower of Babylon   回復  更多評論   

            2006-08-09 19:11 by sicheng
            非常感謝SoRoMan對這道題的關注,甚至還為此寫出了完整的程序。
            程序寫的很漂亮,非常感謝。
            由于本人的疏忽 題目描述地不是很清楚,所以特此也把整個原題貼出來(由于已經寫了簡述,故不再翻譯原題(呵呵,實際上是沒那英文水準~~-_-))

            The Tower of Babylon
            Time Limit:1000MS Memory Limit:65536K
            Total Submit:230 Accepted:147

            Description
            Perhaps you have heard of the legend of the Tower of Babylon. Nowadays many details of this tale have been forgotten. So now, in line with the educational nature of this contest, we will tell you the whole story:
            The babylonians had n types of blocks, and an unlimited supply of blocks of each type. Each type-i block was a rectangular solid with linear dimensions (xi, yi, zi). A block could be reoriented so that any two of its three dimensions determined the dimensions of the base and the other dimension was the height.
            They wanted to construct the tallest tower possible by stacking blocks. The problem was that, in building a tower, one block could only be placed on top of another block as long as the two base dimensions of the upper block were both strictly smaller than the corresponding base dimensions of the lower block. This meant, for example, that blocks oriented to have equal-sized bases couldn't be stacked.

            Your job is to write a program that determines the height of the tallest tower the babylonians can build with a given set of blocks.

            Input
            The input will contain one or more test cases. The first line of each test case contains an integer n,
            representing the number of different blocks in the following data set. The maximum value for n is 30.
            Each of the next n lines contains three integers representing the values xi, yi and zi.
            Input is terminated by a value of zero (0) for n.

            Output
            For each test case, print one line containing the case number (they are numbered sequentially starting from 1) and the height of the tallest possible tower in the format "Case case: maximum height = height"

            Sample Input


            1
            10 20 30
            2
            6 8 10
            5 5 5
            7
            1 1 1
            2 2 2
            3 3 3
            4 4 4
            5 5 5
            6 6 6
            7 7 7
            5
            31 41 59
            26 53 58
            97 93 23
            84 62 64
            33 83 27
            0


            Sample Output


            Case 1: maximum height = 40
            Case 2: maximum height = 21
            Case 3: maximum height = 28
            Case 4: maximum height = 342


            Source
            Ulm Local 1996

            # re: 今天我做的一道經典動歸題The Tower of Babylon   回復  更多評論   

            2006-08-10 02:45 by
            我也跑去做做:)

            # re: 今天我做的一道經典動歸題The Tower of Babylon   回復  更多評論   

            2007-07-29 21:23 by keky
            非常感謝師兄的提示,我DP一貫很差,今個有過了一個。。。受益匪淺!TH

            # re: 今天我做的一道經典動歸題The Tower of Babylon [未登錄]  回復  更多評論   

            2007-07-30 15:35 by oyjpArt
            師兄?你是?

            # re: 今天我做的一道經典動歸題The Tower of Babylon   回復  更多評論   

            2009-04-30 14:32 by 尖尖角
            lz的沒看太明白呢,不過我用深度優先搜索的方法做出來了哦
            算法分析如下:
            1) 將n個石塊存入blocks[3n]中(如lz一樣把每一塊分成三塊,但不用求面積,也不用排序)
            2) 構建blocks的有向鄰接表adj。(eg blocks[i]--> block[j] 的條件是 i的底部長寬都比j的小 即,嚴格小于)
            3) 深度優先搜索整個鄰接表。并用一個數組height[n]記錄以每一個節點為最底層塊的時候的最大高度
            4) 遍歷height[n],值最大的那個就是所求的最大高度了。
            AV无码久久久久不卡蜜桃| 欧美精品丝袜久久久中文字幕| 青青草原综合久久大伊人| 久久精品国产乱子伦| 国内精品久久久久久野外| 欧美日韩成人精品久久久免费看| 国内精品伊人久久久影院| 九九久久99综合一区二区| 久久福利资源国产精品999| 国产亚洲欧美精品久久久| 色综合久久天天综线观看| 成人资源影音先锋久久资源网| 国产精品日韩深夜福利久久| 中文字幕无码免费久久| 久久亚洲国产精品五月天婷| 久久久精品人妻一区二区三区蜜桃| 久久免费99精品国产自在现线| 久久久久亚洲AV片无码下载蜜桃| 青青热久久国产久精品 | 狠狠色丁香久久婷婷综合五月| 九九热久久免费视频| 好久久免费视频高清| 亚洲午夜久久久久久久久久| 很黄很污的网站久久mimi色| 久久久精品国产sm调教网站| 久久久久亚洲精品天堂久久久久久 | 亚洲国产成人精品91久久久| 2020最新久久久视精品爱| 久久综合精品国产二区无码| 99久久香蕉国产线看观香| 精品久久久久中文字幕一区| 日本一区精品久久久久影院| 国产精品美女久久久| 日韩人妻无码精品久久久不卡| 久久天天躁夜夜躁狠狠| 久久亚洲精品无码aⅴ大香| 久久久久久久尹人综合网亚洲 | 手机看片久久高清国产日韩| 久久青青草原亚洲av无码| 久久99热这里只有精品国产| 久久91精品综合国产首页|