HDU 1051 Wooden Sticks【LIS变形】

 Wooden Sticks

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

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

dp[i]表示a[i]这个元素所在的序列；

按照筷子的长度递增排序，判断筷子的重量是否是递增的，若递增满足题意，否则+1； 注意判断是否要+1的时候，还要判断两个筷子是否在同一序列即判断dp[i]<dp[j]+1是否成立，若成立说明在同一序列要+1，不成立说明不在同一序列就不需要+1；

和HDU 1257 最少拦截系统思路一样，但是判断条件需要根据题意来定，不一定都是前者大于后者才需要+1；

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct node
{
	int l,w;
}a[5010];
int dp[5010];
int cmp(node x,node y)
{
	if(x.l!=y.l)
	return x.l<y.l;//按照筷子的长度递增排序，判断筷子的重量是否是递增的，若递增满足题意，否则+1； 
	else 
	return x.w<y.w;
}
int main()
{
	int t,n;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		for(int i=0;i<n;i++)
		{
			scanf("%d%d",&a[i].l,&a[i].w);
			dp[i]=1;
		}
		sort(a,a+n,cmp);
		for(int i=1;i<n;i++)
		{
			for(int j=0;j<i;j++)
			{
				if(a[j].w>a[i].w&&dp[i]<dp[j]+1)//若满足dp[i]<dp[j]+1表示i和j在相同的序列中
				                            // 若在相同的序列中dp[i]就要+1;
				{
					
					dp[i]=dp[j]+1;
				}
			}
		}
		int maxn=0;
		for(int i=0;i<n;i++)
		{
			if(dp[i]>maxn)
			   maxn=dp[i]; 
		}
		printf("%d\n",maxn);
	}
	return 0;
}