FatMouse's Speed
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
题解:给你许多组数据,每组两个数,一个代表老鼠的重量,一个代表老鼠的速度,为了证明老鼠越重速度越慢,让你取出几组 数据证明,问最多能取出几组。体重要严格递增,速度严格递减。既然这样的话,肯定是体重从小到大,速度从大到小, 对速度便是利用求最大递减子序列!
做大递减子序列解析和模板:https://blog.csdn.net/stormbjm/article/details/8919484
代码:
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int l[1010];
int book[1010][1010];
struct node
{
int w,s,d;
}a[1010];
bool cmp(node a,node b)
{
if(a.w!=b.w)
return a.w<b.w;
else
return a.s>b.s;
}
int main()
{
int i,size,j,k,max,t;
i=0;
while(~scanf("%d %d",&a[i].w,&a[i].s))
{
a[i].d=i+1;
i++;
}
size=i;
sort(a,a+size,cmp);
for(i=0;i<size;i++)
{
l[i]=1;
book[i][0]=i;
}
for(i=1;i<size;i++)
{
for(j=i-1;j>=0;j--)
{
if(a[i].w>a[j].w && a[i].s<a[j].s && l[i]<l[j]+1)
{
max=l[j]+1;
l[i]=max;
for(k=0;k<max-1;k++)
book[i][k]=book[j][k];
book[i][max-1]=i;
}
}
}
int x;
for(x=0,k=1;k<size;k++)
if(l[x]<l[k]) x=k;
printf("%d\n",l[x]);
for(i=0;i<l[x];i++)
printf("%d\n",a[book[x][i]].d);
return 0;
}