zju 1108 FatMouse's Speed

ZOJ Problem Set - 1108

FatMouse's Speed

---

Time Limit: 2 Seconds       Memory Limit: 65536 KB       Special Judge

---

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 Specification

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 Specification

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

Output for Sample Input

4
4
5
9
7

#include<stdio.h>
#include<algorithm>
using namespace std;
struct p
{
    int weight,peed,num;
}nn[1001];
int  cmp(p x,p y)
{
    if(x.weight<y.weight)  return true;
    if(x.weight==y.weight&&x.peed>y.weight)  return true;
    else return false;
}
void output(int path[],int pos)
{
    if(pos==0)  return;
    output(path,path[pos]);//利用递归找统计的路径
    printf("%d\n",nn[pos].num);
}
int main()
{
    int n=1,i,j;
    while(scanf("%d %d",&nn[n].weight,&nn[n].peed)!=EOF)
    {
        nn[n].num=n;
        n++;
    }
    sort(nn+1,nn+n,cmp);
    int count[1001]={0},path[1001]={0};count[1]=1;
    for(i=2;i<n;i++)
       {
           for(j=1;j<i;j++)
            if(nn[i].weight>nn[j].weight&&nn[i].peed<nn[j].peed)
            if(count[i]<count[j])
            {   //满足第一个if并且满足第二个if，说明第j个有多少个，那么第i个也是可以容纳下来的。
                count[i]=count[j];//count数组就是统计前面有多少个比自己小的个数
                path[i]=j;//统计路径，能容纳，就把第j个的位置计入path里面去，
                //找的时候就会找到上一个的满足上面两个if条件的那个位置
            }
            count[i]++;//自己本身要加1
       }
       int max=0;int pos;
       for(i=1;i<n;i++)
           if(count[i]>max)  {max=count[i];pos=i;}
         printf("%d\n",max);
         output(path,pos);
    return 0;
}