【HD 1051】 Wooden Sticks（LIS 变形题）

Wooden Sticks

Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit

Status
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

—————————————————————————————————————————————————

#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;

const int INF = 0x3f3f3f3f;
struct stack{
    int l;
    int w;
}st[5001];

bool cmp( stack x,stack y )
{
    return x.l < y.l;
}
int ap[5005];
int dp[5005];
int main()
{
    int t,n,pos;
    scanf("%d",&t);
    while( t-- )
    {
        scanf("%d",&n);
        memset(dp,0,sizeof(dp));
        for( int i=1; i<=n; i++ )
        {
            scanf("%d%d",&st[i].l,&st[i].w);
        }
        sort(st+1,st+n+1,cmp);
        for( int i=1; i<=n; i++ )
        {
            ap[i] = st[i].w;
        }
        // 有点逆向思维的感觉 比前面的大 就不需要时间 反之 比前面的小 ，时间加 1 
        // 最长不下降子序列里是 比前面的大 长度加一 
        int top = 0;
        for( int i=1; i<=n; i++ )
        {
            dp[i] = 1;
            for( int j=1; j<=n; j++ )
            {
                if( ap[i] < ap[j] && dp[i] < dp[j]+1 )
                dp[i] = dp[j]+1;
            }
        }
        int ans = 0;
        for( int i=1; i<=n; i++ )
        {
            if( ans < dp[i])
            ans = dp[i];
        }
        printf("%d\n",ans);
    }
    return 0;
}