HDU 1059：Wooden Sticks（DP之LIS）

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

题意：输入t个例子，然后是一个n，下面一行跟了L1，W1，L2，W2…Ln，Wn，如果L与W都严格小于上一个可以凑成一块，问共需要凑成多少块

题解：基础LIS，加个结构体多比较一次就可以了

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

struct lu
{
    int a,b;
}e[5050];

struct lu1
{
    int x,y;
}w[5050];

bool cmp(lu q,lu p)
{
    return q.a>p.a;
}

int main()
{
    int n,k,r,t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(int i=0;i<n;i++)
        {
            scanf("%d%d",&e[i].a,&e[i].b);  
        }
        sort(e,e+n,cmp);
        r=0;
        memset(w,0,sizeof(w));
        for(int i=0;i<n;i++)
        {
            k=0;
            for(int j=0;j<r;j++)
            {
                if(e[i].a<=w[j].x&&e[i].b<=w[j].y)
                {
                    w[j].x=e[i].a;
                    w[j].y=e[i].b;
                    k=1;
                    break;
                }
            }
            if(k==0)
            {
                w[r].x=e[i].a;
                w[r].y=e[i].b;
                r++;
            }
        }
        printf("%d\n",r);
    }
    return 0;
}