10131 - Is Bigger Smarter? 水dp

最新推荐文章于 2020-04-02 19:50:46 发布

cyendra

最新推荐文章于 2020-04-02 19:50:46 发布

阅读量958

点赞数

分类专栏：解题报告 DP 文章标签：动态规划题解 dp

本文链接：https://blog.csdn.net/cyendra/article/details/8841722

版权

解题报告同时被 2 个专栏收录

260 篇文章

订阅专栏

89 篇文章

订阅专栏

Question 1: Is Bigger Smarter?

The Problem

Some people think that the bigger an elephant is, the smarter it is. To disprove this, you want to take the data on a collection of elephants and put as large a subset of this data as possible into a sequence so that the weights are increasing, but the IQ's are decreasing.

The input will consist of data for a bunch of elephants, one elephant per line, terminated by the end-of-file. The data for a particular elephant will consist of a pair of integers: the first representing its size in kilograms and the second representing its IQ in hundredths of IQ points. Both integers are between 1 and 10000. The data will contain information for at most 1000 elephants. Two elephants may have the same weight, the same IQ, or even the same weight and IQ.

Say that the numbers on the i-th data line are W[i] and S[i]. 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 an elephant). If these n integers are a[1], a[2],..., a[n] then it must be the case that

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

and

   S[a[1]] > S[a[2]] > ... > S[a[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 IQs 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 EL{
    int x;
    int y;
    int id;
}a[11111];

bool cmp(EL a,EL b)
{
    if (a.x==b.x) return a.id<b.id;
    return a.x<b.x;
}

int n;
int f[11111]={0};
int p[11111]={0};
int ans[11111]={0};
int cnt;

int main()
{
    n=1;
    while (~scanf("%d%d",&a[n].x,&a[n].y)){a[n].id=n;n++;}
    n--;
    sort(a+1,a+n+1,cmp);
    int mx=0;
    int ww=0;
    //for (int i=1;i<=n;i++){cerr<<a[i].x<<" "<<a[i].y<<" "<<a[i].id<<endl;}
    for (int i=1;i<=n;i++)
    {
        f[i]=1;
        p[i]=0;
        for (int k=1;k<i;k++)
        {
            if (a[i].y<a[k].y&&a[i].x>a[k].x&&f[k]+1>f[i])
            {
                f[i]=f[k]+1;
                p[i]=k;
            }
        }
        if (f[i]>mx)
        {
            mx=f[i];
            ww=i;
        }
    }
    //for (int i=1;i<=n;i++) cerr<<f[i]<<" ";cerr<<endl;
    printf("%d\n",mx);
    cnt=0;
    while (ww!=0)
    {
        ans[cnt++]=a[ww].id;
        ww=p[ww];
    }
    for (int i=cnt-1;i>=0;i--)
    {
        printf("%d\n",ans[i]);
    }
    return 0;
}