Wooden Sticks

                    Wooden Sticks
    Time Limit: 1000MS      Memory Limit: 10000K
    Total Submissions: 21785        Accepted: 9296
    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 ( 9 , 4 ) , ( 2 , 5 ) , ( 1 , 2 ) , ( 5 , 3 ) , and ( 4 , 1 ) , then the minimum setup time should be 2 minutes since there is a sequence of pairs ( 4 , 1 ) , ( 5 , 3 ) , ( 9 , 4 ) , ( 1 , 2 ) , ( 2 , 5 ) .
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 2n 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

一道好题这个题用DP中LIS去写先按找L从小到大的排序 然后找出按照W的最长递减序列就可以那个最短序列的长度就是最终的答案
为什么了？
题目的确需要稍加思考，这道题的要求其实是将所有stick分为x个不下降子序列( Ai <= Ai+1 )，然后问题归结于求x的最小值。

x的最小值其实等于按l递增排序后stick按w最长下降子序列的长度L，证明如下：

若x < L，先从stick中取出最长下降子序列L，取走的元素留下一个大小相同的“空穴”，然后将剩下的元素和空穴分成x个不下降子序列。接着把最长下降子序列L中的L个元素放回这L个空穴里。由于x < L，所以根据鸽笼原理，必然有两个或两个以上的下降子序列L中的元素(b > a)被按顺序放到同一个不下降子序列(a <= b)，产生矛盾（两者本应该是等效的）。
这是看别人的题解我居然看懂了QAQ 理解起来有些复杂 存着这是种好的思想

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <stack>

using namespace std;
const int MAXX=5000+10;
const int INF=0x3f3f3f;
struct node{
    int L;
    int W;
}ans[MAXX];
int c[MAXX];
int n;
int ant;
bool cmp(node a,node b){
    if(a.L==b.L)
        return a.W<b.W;
    return a.L<b.L;

}
int main(){
    int T; scanf("%d", &T);
    while( T-- ){
        scanf("%d",&n);
        for(int i = 1; i <= n; ++i ){
            scanf("%d %d",&ans[i].L,&ans[i].W); c[i]=INF;
        }
        sort(ans+1,ans+1+n,cmp); ant=0;
        for(int i=n;i>=1;--i){
            int k=lower_bound(c+1,c+1+n,ans[i].W)-c;
            c[k]=min(c[k],ans[i].W);
            ant=max(k,ant);
        }
        printf("%d\n",ant);
    }
    return 0;
}

下面是别人用贪心写的代码了 这个比较好理解

// 贪心算法---先排序---后选择第一个没有用过的木头一次向后找，用掉所有可以用掉的木头，然后返回第一个没用过的木头继续找
#include<cstdio>
#include<algorithm>
using namespace std;
struct stick
{
    int len;
    int wei;
}a[5001];
bool used[5001];

bool cmp(stick k1,stick k2)       //按照长度从小到大排序，若长度相同按照重量递增排序
{
    if(k1.len==k2.len)
        return k1.wei<k2.wei;
    else
        return k1.len<k2.len;
}

int main()
{
    int T,n,i,j,st,count;
    bool flag;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        for(i=0;i<n;++i)
            scanf("%d%d",&a[i].len,&a[i].wei);
        sort(a,a+n,cmp);
        memset(used,false,sizeof(used));
        used[0]=true;
        st=0;       //记录第一个没有用过的木头
        count=0;
        while(st<n)
        {
            ++count;
            for(i=st+1,j=st,flag=true;i<n;++i)
            {
                if(used[i])
                    continue;
                if(a[j].len<=a[i].len&&a[j].wei<=a[i].wei)
                {
                    used[i]=true;
                    j=i;
                }
                else 
                {
                    if(flag)
                    {
                        st=i;      //只记录第一个没用过的木头
                        flag=false;
                    }
                }
            }
            if(flag)    //说明都用过了
                break;
        }
        printf("%d\n",count);
    }
    return 0;
}