Wooden Sticks（贪心+单调递增子序列）

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

分析：先对N组数排序，比如题中的样例1排完序后为1 4,2 1,3 5,4 9，5 2，此时从第一组数开始比较，比1 4 大的有3,5，比3,5大的有4,9,后面没有了，时间加1.返回2 1，开始比较比2 1，大的有5 2，（因为3 5,4 9用过了）时间加1，所有组数都用过了，总时间为2.

代码如下：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct node
{
	int l,w;
}s[5020];

bool cmp(struct node len,struct node len1)
{
	if(len.l==len1.l)
	return len.w<len1.w;
	else
	return len.l<len1.l;
}
int main()
{
	int t,x,n,m,i,j,d,book[5020],w1;
	scanf("%d",&t);
	while(t--)
	{
		d=0;
		memset(book,0,sizeof(book));
		scanf("%d",&n);
		for(i=0;i<n;i++)
		{
			scanf("%d%d",&s[i].l,&s[i].w);
		}
		sort(s,s+n,cmp);
		for(i=0;i<n-1;i++)
		{
			w1=s[i].w;
			if(book[i]==0)
			{
				for(j=i+1;j<n;j++)
				{
					if(book[j]==0&&s[j].l>=s[i].l&&s[j].w>=w1)
					{
						book[j]=1;
						w1=s[j].w;
					}
				}
				d++;
				book[i]=1;
			}
		}
		if(book[n-1]==0)
		d++;
		printf("%d\n",d);
	}
	return 0;
}