• <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 閱讀(585) 評論(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久久国产综合精品宅男自 | 97精品久久天干天天天按摩| 久久免费美女视频| 亚洲国产日韩欧美综合久久| 精品久久久久久久久午夜福利| 久久久久国色AV免费观看| 欧美精品久久久久久久自慰| 久久天天躁狠狠躁夜夜2020| 国内精品久久人妻互换| 国产精久久一区二区三区| 国产精品久久久久久吹潮| 久久久久噜噜噜亚洲熟女综合| 亚洲AV无码1区2区久久| 日本高清无卡码一区二区久久| 亚洲国产美女精品久久久久∴| 国产成人精品久久亚洲高清不卡 国产成人精品久久亚洲高清不卡 国产成人精品久久亚洲 | 亚洲午夜久久影院| 国产精品久久国产精品99盘| 久久久久国产一级毛片高清板| 久久精品国产亚洲av麻豆色欲 | 看久久久久久a级毛片| 性做久久久久久久久| 国产精品女同一区二区久久| 99久久这里只有精品| 久久久久亚洲AV无码观看| 国产三级精品久久| 久久久久亚洲av无码专区| 伊人久久大香线蕉AV一区二区| 狠狠久久综合| 久久精品国产免费| 久久精品无码一区二区三区免费| 亚洲国产精品无码久久久不卡| 三级三级久久三级久久| 亚洲精品无码久久毛片| 色综合久久夜色精品国产| 久久SE精品一区二区| 香港aa三级久久三级老师2021国产三级精品三级在| 九九99精品久久久久久|