【hdoj 1160】FatMouse's Speed

FatMouse's Speed

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 10893 Accepted Submission(s): 4789

Special Judge

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找出速度的最长升序子序列，输出序列号。

中间过程：

mi=4
i pre[i] mice[i].w mice[i].s mice[i].no
1 1 8000 1400 7
2 7 6008 1300 1
3 9 6000 1200 8
4 5 6000 2000 6
5 6 6000 2100 2
6 7 2000 1900 9
7 7 1100 3000 5
8 8 1000 4000 4
9 7 500 2000 3

code：

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <string.h>
using namespace std;
struct node
{
    int w,s;
    int no;
}mice[1005];
int dp[1005],pre[1005];
int cmp(node a,node b)
{
    if(a.w==b.w)
        return a.s<b.s;
    else
        return a.w>b.w;
}
int main()
{
    int m,i,mi,mx,maxi;
    int t=1;
    while(scanf("%d%d",&mice[t].w,&mice[t].s)!=EOF)
    {
        mice[t].no=t;
        dp[t]=0;
        pre[t]=t;
        t++;
    }
    sort(mice+1,mice+t,cmp);
    for(m=0,i=1;i<t;i++)
    {
        mx=0;
        for(int j=1;j<i;j++)
        {
            if(mice[i].w!=mice[j].w&&mice[i].s>mice[j].s)
            {
                if(mx<dp[j])
                {
                    mx=dp[j];
                    maxi=mice[j].no;
                }
            }
        }
        if(mx)
            pre[mice[i].no]=maxi;
        dp[i]=mx+1;
        if(m<dp[i])
        {
            m=dp[i];
            mi=mice[i].no;
        }
    }
    if(m==1)
    {
      printf("1\n1\n");
    }
    else
    {
        printf("%d\n",m);
        while(pre[mi]!=mi)
        {
           printf("%d\n",mi);
           mi=pre[mi];
        }
        printf("%d\n",mi);
   }
    return 0;
}