FatMouse's Speed

FatMouse's Speed

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 50   Accepted Submission(s) : 16

Special Judge

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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

dp问题，代码如下：

#include<iostream>
#include<algorithm>
using namespace std;
int dp[1001];//表示以i结尾的最长子序列长度
int f[1001];//记录i对应的上一个数据
int s[1001];//从后往前找时，存放最终结果下标
struct Mouse
{
 int w,s;//重量和速度
 int num;//记录排序之前的位置
}mouse[1001];
int cmp(Mouse a,Mouse b)//先按w从大到小排，再按r从小到大排
{
 if(a.w<b.w||a.w==b.w&&a.s>b.s) return 1;
 return 0;
}
int main()
{
 int n,m,x,y,i,j,min,maxlen,maxi;
 n=0;
 while(scanf("%d%d",&x,&y)!=EOF)
 {
  n++;
  dp[n]=1;f[n]=0;
  mouse[n].w=x;
  mouse[n].s=y;
  mouse[n].num=n;
 }
 sort(mouse+1,mouse+n+1,cmp);//排序
 dp[1]=1;dp[0]=0;
 maxlen=1;//最长序列长度
 maxi=1;//最长序列最后一个下标
 for(i=1;i<=n;i++)
 {
  min=0;
  for(j=1;j<i;j++)
   if(mouse[j].w<mouse[i].w && mouse[j].s>mouse[i].s && dp[j]+1>dp[i]&&dp[j]>dp[min]) min=j;
   if(min!=0)
   {
    dp[i]=dp[min]+1;
    f[i]=min;
    if(dp[i]>maxlen)
    {
     maxi=i;
     maxlen=dp[i];
    }
   }
 }
 m=0;
 while(maxlen>0)//保存到s[m]
 {
  m++;
  s[m]=maxi;
  maxi=f[maxi];
  maxlen--;
 }
 cout<<m<<endl;
 while(m>0)
 {
  cout<<mouse[s[m]].num<<endl;
  m--;
 }
 return 0;
}