HDU1160 FatMouse's Speed

最新推荐文章于 2021-06-01 18:00:21 发布

他说少年如歌

最新推荐文章于 2021-06-01 18:00:21 发布

阅读量201

点赞数

分类专栏：动态规划文章标签：动态规划

本文链接：https://blog.csdn.net/qq_27437781/article/details/51199361

版权

动态规划专栏收录该内容

12 篇文章 0 订阅

订阅专栏

点击打开题目链接

FatMouse's Speed

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 13707 Accepted Submission(s): 6050
Special Judge

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

Sample Output

题目的意思就是每行给你老鼠的重量和速度

然后按照重量递增排序找速度的最长递减子序列

或者按照速度递减排序找重量的最长递增子序列

最后输出最长递减（递增）子序列的最大长度

以及各个老鼠所在的原始位置

切记：输出的是原先的位置不是排序后的位置所以要把原先的位置记录下来

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

struct node
{
    int w;
    int s;
    int xu;    ///用来保存老鼠的原先位置
}a[1000];
int dp[1001],p[1001];
bool cmp(node x,node y)
{
    return x.w < y.w;
}
int main()
{
    int i = 1,m,n;
    while(~scanf("%d%d",&m,&n))
    {
        a[i].w = m;
        a[i].s = n;
        a[i].xu = i;
        i++;
    }
    int max = -0x3f3f3f3f;
    sort(a,a+i,cmp);
    //memset(dp,0,sizeof(dp));
    /*for(int t = 1; t < i; t++)
        printf("%d %d %d\n",a[t].w,a[t].s,a[t].xu);*/
    for(int j = 1; j < i; j++) ///最长递减子序列
    {
        dp[j] = 1;
        p[j] = 1;
        for(int k = 1; k < j; k++)
        {
            if(a[j].w>a[k].w&&a[j].s<a[k].s)
            {
                if(dp[j] < dp[k] + 1)
                {
                    dp[j] = dp[k] + 1;
                }
            }
        }
        if(max < dp[j])
            max = dp[j];
    }
    printf("%d\n",max);
    int h = 0;
    for(int k = i; k > 0; k--) ///找到最长递减子序列的各个老鼠排好序的位置然后再找原先的位置
    {
        if(dp[k]==max)
        {
             p[h] = a[k].xu;
             h++;
             max--;
        }
    }
    for(int l = h - 1; l >= 0; l--)
    {
        printf("%d\n",p[l]);
    }
    return 0;
}