【HDU 1051 Wooden Sticks】+ 贪心

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

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

Source
Asia 2001, Taejon (South Korea)

Recommend
We have carefully selected several similar problems for you: 1050 1045 1053 1800 1069

AC代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int vis[5010];
struct node{
   int l,v;
}st[5010];
bool cmp(node i,node j){
    if(i.l == j.l) return i.v < j.v;
    return i.l < j.l;
}
int main()
{
    int T,N;
    scanf("%d",&T);
    while(T--){
        scanf("%d",&N);
        memset(vis,0,sizeof(vis));
        for(int i = 1 ; i <= N; i++)
            scanf("%d %d",&st[i].l,&st[i].v);
        sort(st + 1, st + 1 + N,cmp);
        int num = 0,nl = 1,ok = 0;vis[1] = 1;
        while(nl <= N){
            num++,ok = 1;
            for(int i = nl + 1,pl = nl;i <= N; i++){
            if(vis[i]) continue;
            if(st[pl].l <= st[i].l && st[pl].v <= st[i].v) vis[i] = 1,pl = i;  // 更新最优解 : 因为是按照 l 降序排列，所以 v 只有在 l 与前一个相同的情况下才为降序
            else if(ok) nl = i,ok = 0;
            }
            if(ok) break;
        }
        printf("%d\n",num);
    }
    return 0;
}