• <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>
            posts - 21, comments - 2, trackbacks - 0, articles - 0

            HDU 1160 ZOJ 1108 FatMouse's Speed

            Posted on 2011-10-03 03:24 acpeng 閱讀(584) 評論(0)  編輯 收藏 引用 所屬分類: ACM程序
            題目鏈接:http://acm.hdu.edu.cn/showproblem.php?pid=1160
            Problem Description
            FatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a collection of mice and put as large a subset of this data as possible into a sequence so that the weights are increasing, but the speeds are decreasing.
             
            Input
            Input contains data for a bunch of mice, one mouse per line, terminated by end of file.
            The data for a particular mouse will consist of a pair of integers: the first representing its size in grams and the second representing its speed in centimeters per second. Both integers are between 1 and 10000. The data in each test case will contain information for at most 1000 mice.
            Two mice may have the same weight, the same speed, or even the same weight and speed.
            Output
            Your program should output a sequence of lines of data; the first line should contain a number n; the remaining n lines should each contain a single positive integer (each one representing a mouse). If these n integers are m[1], m[2],..., m[n] then it must be the case that

            W[m[1]] < W[m[2]] < ... < W[m[n]]

            and

            S[m[1]] > S[m[2]] > ... > S[m[n]]

            In order for the answer to be correct, n should be as large as possible.
            All inequalities are strict: weights must be strictly increasing, and speeds must be strictly decreasing. There may be many correct outputs for a given input, your program only needs to find one.
             
            Sample Input
            6008 1300 6000 2100 500 2000 1000 4000 1100 3000 6000 2000 8000 1400 6000 1200 2000 1900




            Sample Output
            4 4 5 9 7
            解題思路:
            首先根據weight的數值由小到大排序,然后再以speed為標準,求最長下降子序列,思路還是DP,但是要標記子序列的下標
            麻煩多了,我的做法:
            定義MaxIncludeEnd數組,令MaxIncludeEnd[i]表示以a[i]結尾的最長下降子序列的長度,那么
            MaxIncludeEnd[i]=max{ MaxIncludeEnd[i] , a[j]>a[i] ? (MaxIncludeEnd[j]+1) :-1; }
            其中j=0:i-1;MaxIncludeEnd[i]的初始值為1,每一個i結束后用max和MaxIncludeEnd[i]比較,更新max和下標max_flg。
            因為要標記下標,在計算MaxIncludeEnd[i]后,用flg[i]表示以a[i]結尾的最長下降子序列的前一個元素的下標,這樣計算完
            MaxIncludeEnd[n]并更新完max和max_flg以后,循環遞推一次就可以得到所有的元素下標,即flg[max_flg],flg[ flg[max_flg] ],……
            當然這里的下標是逆向的,要設置個新的數組來將其逆轉。
            ps:如果從后往前計算最長上升子序列,那就不必如此麻煩,減少空間。
            code



            久久综合九色综合久99 | 精品国产VA久久久久久久冰| 国产精品视频久久久| 久久精品国产福利国产琪琪 | 亚洲精品乱码久久久久久| 品成人欧美大片久久国产欧美| 免费久久人人爽人人爽av| 99国内精品久久久久久久 | 国产免费福利体检区久久| 久久香蕉超碰97国产精品| 日本WV一本一道久久香蕉| 国产精品午夜久久| 国产精品无码久久综合| 日产精品99久久久久久| 伊人久久大香线蕉成人| 久久精品99无色码中文字幕| 欧美久久精品一级c片片| 婷婷伊人久久大香线蕉AV | 午夜精品久久影院蜜桃 | 久久久国产精品| 日本道色综合久久影院| 久久精品国产免费一区| 久久久精品2019免费观看| 精品国产乱码久久久久软件| 少妇久久久久久被弄到高潮| 国内精品伊人久久久久影院对白| 国产亚洲欧美精品久久久| 亚洲精品无码久久一线| 久久www免费人成看片| 久久久久亚洲AV无码观看 | 久久精品国产亚洲av麻豆图片| 久久久久亚洲av成人无码电影| 久久99国产一区二区三区| 伊人热人久久中文字幕| 91精品无码久久久久久五月天| 国产精品视频久久久| 久久免费高清视频| www亚洲欲色成人久久精品| 国产福利电影一区二区三区久久久久成人精品综合 | 欧美久久综合九色综合| 久久久99精品一区二区|