FatMouse's Speed

最新推荐文章于 2022-03-23 20:55:14 发布

UMR小豪

最新推荐文章于 2022-03-23 20:55:14 发布

阅读量251

点赞数 1

分类专栏：基础dp 文章标签： dp

本文链接：https://blog.csdn.net/qq_33362864/article/details/73090409

版权

基础dp 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

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 1, m 2 2,..., m n nthen it must be the case that

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

and

S m[1 m[1] > S m[2 m[2] > ... > S m[n 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

做法，简单线性dp，排个序，然后就像跑最长上升子序列一样就可以了。

#include <bits/stdc++.h>

using namespace std;
const int MAXN = 1e3+7;
const int mod = 1e9+7;
int n;
struct node
{
    int w,s;
    int id;
    bool operator < (const node &a)const
    {
        if(w != a.w)return w < a.w;
        else return s < a.s;
    }
} p[MAXN];

struct dp
{
    int num;
    int now,pre;
} dp[MAXN];



int main()
{
    n = 1;
    while(~scanf("%d%d",&p[n].w,&p[n].s))
    {
        p[n].id = n;
        n++;
    }
    sort(p+1,p+1+n);
    for(int i = 1 ; i <= n ; ++i)
    {
        int MAX = 0,pos = 0;
        for(int j = 1 ; j < i ; ++j)
        {
            if(p[i].w > p[j].w && p[i].s < p[j].s && dp[j].num > MAX)
            {
                MAX = dp[j].num;
                pos = j;
            }
        }
        dp[i].now = i;
        dp[i].pre = pos;
        dp[i].num = MAX + 1;
    }
    int MAX = 0,pos = 0;
    for(int i = 1 ; i <= n ; ++i)if(dp[i].num > MAX)
    {
        MAX = dp[i].num;
        pos = i;
    }
    printf("%d\n",MAX);
    stack<int>S;
    int e = pos;
    while(e)
    {
        S.push(e);
        e = dp[e].pre;
    }
    while(!S.empty())
    {
        printf("%d\n",p[S.top()].id);
        S.pop();
    }
    return 0;
}