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
题目大意:给出很多老鼠的数据,分别是它们的体重和跑速,为了证明老鼠越重跑得越慢,要找一组数据,由若干个老鼠组成,保证老鼠的体重依次增加而跑速依次减小,问这组数据最多能有多少老鼠,并按体重从小到大输出这些老鼠的顺序。
思路:对老鼠的体重从大到小排序,即老鼠所对应的速度从小到大,要求最多能找到多少,即问题转化成最长上升子序列的长度。
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct node
{
int w;
int v;
int mi;
} q[1010];
int dp[1010];
int pre[1010];
bool cmp(node t1,node t2)
{
return t1.w>t2.w;
}
int main()
{
int t=0;
while(~scanf("%d%d",&q[t].w,&q[t].v))
{
q[t].mi=t+1;
t++;
}
sort(q,q+t,cmp);
memset(pre,-1,sizeof(pre));
fill(dp,dp+t,1);
for(int i=0; i<t; i++)
{
for(int j=0; j<i; j++)
{
if(q[j].w>q[i].w&&q[j].v<q[i].v)
{
if(dp[i]<dp[j]+1)
{
dp[i]=dp[j]+1;
pre[i]=j;
}
}
}
}
int ans=0;
int k;
for(int i=0; i<t; i++)
{
if(dp[i]>ans)
{
ans=dp[i];
k=i;
}
}
printf("%d\n",dp[k]);
while(k!=-1)
{
printf("%d\n",q[k].mi);
k=pre[k];
}
return 0;
}