HDU 1501（Wooden Sticks LIS）

Wooden Sticks
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 18541 Accepted Submission(s): 7557

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

题意：给你 t 个测试数据， n 个木头， 然后是每个木头的长度L，与重量W， 一个木头的长度和重量都打印另一个的时候就可以合并一起做，如果不能就多做一次， 问你最少做多少次。。。
题解：和导弹拦截差不多，我们可以把这些个木头按照长度从大到小排序，然后就相当于做导弹拦截了

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define M 10010
#define INF 0x3f3f3f
#define RCL(a, b) memset(a, b, sizeof(a))

struct node
{
    int v, w;
};
node no[M];
bool cmp(node a, node b)
{
    return a.v > b.v;
}

int main()
{
    int n, m, t, dp[M];
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d", &n);
        for(int i=1; i<=n; i++)
        {
            scanf("%d%d", &no[i].v, &no[i].w);
            dp[i] = 1;//初始值为 1
        }
        sort(no+1, no+n+1, cmp);//排序
        int maxd = 0;
        for(int i=2; i<=n; i++)
        {
            for(int j=1; j<i; j++)
            {
                if(no[i].w > no[j].w && dp[i] < dp[j] + 1)//重量大于前面并且次数小于第 j 次加 1 时
                {
                    dp[i] = dp[j] + 1;
                }
                maxd = max(dp[i], maxd);
            }
        }
        printf("%d\n", maxd);
    }

    return 0;
}