hdu 1051 （简单贪心）

Wooden Sticks

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 19374 Accepted Submission(s): 7889


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

题意：题意是：将木棍放在机器里处理，第一根需要一分钟，剩余的如果大于等于前边放入的长度和重量，就不用费时间，否则需要一分钟，计算给出一组数的最少时间！用贪心算出最少降序序列个数！

一开始由于英文题，没翻译清除，一直wa

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
struct node{
	int l,w,m;
}p[10000];
int cmp(node a,node b)    //按照长度和重量排序 
{
	if(a.l==b.l) 
	return a.w<b.w;
	else
	return a.l<b.l;
}
int main()
{
	int T;
	scanf("%d",&T);
	while(T--)
	{
		int n,ans,x;
		ans=x=0;
		scanf("%d",&n);
		for(int i=0;i<n;i++)
		{
			scanf("%d %d",&p[i].l,&p[i].w);
			p[i].m=0;
		}
		sort(p,p+n,cmp);
	    	for(int i=0;i<n;i++)
	    	{
	    		if(p[i].m==1) continue;   //访问过了就直接跳过 
	    		node p1;
	    		p1.l=p[i].l,p1.w=p[i].w;   //给要比较的l，w赋值 
				p[i].m=1;                //标记 
	    		ans++;                   
	    		for(int j=i;j<n;j++)
	    		{
	    			if(p[j].l>=p1.l&&p[j].w>=p1.w&&p[j].m==0)
	    			{
	    				p[j].m=1;
	    				p1.l=p[j].l;
	    				p1.w=p[j].w;
					}
				}
		    }
		    printf("%d\n",ans);
	}
}