zoj 1025 &&poj 1065 Wooden Sticks

zoj    poj

---

Time Limit: 2 Seconds        Memory Limit: 65536 KB

---

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

Output for the Sample Input

2 
1 
3

---

Source: Asia 2001, Taejon (South Korea)

 

解题思路：

将数组按从小到大的顺序进行排序，以长度为第一关键字，重量为第二关键字。

排序后可知，长度是随着坐标严格递增的。

因此，我们每次从开头选取未加工的木棍，

然后按重量递增标记符合条件的木棍。

循环完成对整个数组的操作。

 

#include"stdio.h"
#include"stdlib.h"
#include"string.h"
#define N 5005
struct node
{
	int l,w;
}f[N];

int cmp(const void*a,const void*b)       //对结构体进行排序
{
	if((*(struct node*)a).l==(*(struct node*)b).l)
		return (*(struct node*)a).w-(*(struct node*)b).w;       
	return (*(struct node*)a).l-(*(struct node*)b).l;
}
int main()
{
	int t,n,i,mark[N],ans;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		for(i=0;i<n;i++)
			scanf("%d%d",&f[i].l,&f[i].w);
		qsort(f,n,sizeof(f[0]),cmp);
		memset(mark,0,sizeof(mark));
		ans=0;
		while(1)
		{
			int l,w;
			for(i=0;i<n;i++)         
				if(!mark[i])
				{
					l=f[i].l;
					w=f[i].w;
					mark[i]=1;
					ans++;
					break;
				}
			if(i==n)       
				break;
			for(;i<n;i++)
				if(!mark[i]&&l<=f[i].l&&w<=f[i].w)
				{
					mark[i]=1;
					l=f[i].l;
					w=f[i].w;
				}
		}
		printf("%d\n",ans);
	}
	return 0;
}