hdu 1051 Wooden Sticks

Problem Description

There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows: 

(a) The setup time for the first wooden stick is 1 minute. 
(b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l' and weight w' if l<=l' and w<=w'. Otherwise, it will need 1 minute for setup. 

You are to find the minimum setup time to process a given pile of n wooden sticks. For example, if you have five sticks whose pairs of length and weight are (4,9), (5,2), (2,1), (3,5), and (1,4), then the minimum setup time should be 2 minutes since there is a sequence of pairs (1,4), (3,5), (4,9), (2,1), (5,2).

 

Input

The input consists of T test cases. The number of test cases (T) is given in the first line of the input file. Each test case consists of two lines: The first line has an integer n , 1<=n<=5000, that represents the number of wooden sticks in the test case, and the second line contains n 2 positive integers l1, w1, l2, w2, ..., ln, wn, each of magnitude at most 10000 , where li and wi are the length and weight of the i th wooden stick, respectively. The 2n integers are delimited by one or more spaces.

 

Output

The output should contain the minimum setup time in minutes, one per line.

 

Sample Input

  
  

   
   3 
5 
4 9 5 2 2 1 3 5 1 4 
3 
2 2 1 1 2 2 
3 
1 3 2 2 3 1
  
  

 

Sample Output

  
  

   
   2
1
3
  
  

 

PS:中间出了小插曲。主要想法还是贪心+单调递减子序列

以及写的CMP函数（SS A,SS B）

{return A.b<=B.b;//等于的情况的控制、、

//if(A.b==B.b)

return A.c<B.c;

}

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct SS{
int b;
int c;}a[5020];
bool cmp(SS A,SS B)
{
    if(A.b==B.b)
        return A.c<B.c;
    return A.b<B.b;
}
int main()
{
    int t,n;
    int dp[5020];
    scanf("%d",&t);
    while(t--)
    {
        memset(a,0,sizeof(a));
        scanf("%d",&n);
        int maxx=1;
        for(int i=0;i<n;i++)
        {
            scanf("%d %d",&a[i].b,&a[i].c);
        }
        sort(a,a+n,cmp);
        for(int i=0;i<n;i++)
        {
            dp[i]=1;
            for(int j=0;j<i;j++)
            {
                if(a[j].c>a[i].c&&dp[j]+1>dp[i])//最长单调递减子序列
                    dp[i]=dp[j]+1;
                if(maxx<dp[i])
                    maxx=dp[i];
            }
        }
        printf("%d\n",maxx);
    }
}