HDU 1160 FatMouse's Speed

 

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

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<algorithm>
using namespace std;
#define MAXN 1000

struct mouse
{   
 int w,s;     //重量和速度    
 int index;   //最初的序号，避免排序后乱掉顺序，后面需要输出的
}s[MAXN+10];

bool cmp(mouse a,mouse b)//按照weight进行从小到大的排序，按照speed进行从大到小的排序、、、、
{   
 if(a.w<b.w) 
  return 1;   
 else if(a.w==b.w&&a.s>b.s)
  return 1;   
 else return 0;
}   

int dp[MAXN+10];//dp[i]表示以第i个数据结尾的符合要求的子列长度
int p[MAXN+10];//记录i对应的上一个数据
int r[MAXN+10];//存放最终结果下标

int main()
{      
 int i=1,j;   
 while(scanf("%d%d",&s[i].w,&s[i].s)!=EOF)   
 {       
  dp[i]=1;       
  p[i]=0;       
  s[i].index=i;        //这句代码的意思是给输入的那些数进行编号、、、、、
  i++;   
 } 
 
 int n=i-1;   
 sort(s+1,s+n,cmp);   
 int maxlen=0;//最长序列长度    
 int maxi;//最长序列的最后一个数下标    
 dp[1]=1;   
 for(i=1;i<=n;i++)   
 {       
  for(j=1;j<i;j++)           
   if(s[i].w>s[j].w&&s[i].s<s[j].s&&dp[j]+1>dp[i])           
   {                
    dp[i]=dp[j]+1;                
    p[i]=j;                
    if(dp[i]>maxlen)                
    {                      
     maxi=i;                      
     maxlen=dp[i];                                      
    }               
   }                    
 }   
 int t=maxi;   
 i=0;   
 while(t!=0)   
 {       
  r[i++]=t;         //r[MAXN]数组存放的是最长公共子序列里面的数对的下标、、、、
  t=p[t];   
 }    

 printf("%d\n",i);   
 while(i>0)   
 {       
  i--;       
  printf("%d\n",s[r[i]].index);     //输出这些序列所对应的相应的数对、、、、、
 }     
 return 0;            
}   

这段代码不是我写的，我只是在上面改了一下。由于对最长上升子序列还是很熟悉，所以参考了一下别人的。。。。继续努力 加油！！！