POJ1065最长不下降子序列&&Dilworth定理&&动态规划

Dilworth定理：对于一个偏序集，最少链划分等于最长反链长度。

Dilworth定理的对偶定理：对于一个偏序集，其最少反链划分数等于其最长链的长度。

即把一个数列划分成最少的最长不升子序列的数目就等于这个数列的最长上升子序列的长度。

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 ( 9 , 4 ) , ( 2 , 5 ) , ( 1 , 2 ) , ( 5 , 3 ) , and ( 4 , 1 ) , then the minimum setup time should be 2 minutes since there is a sequence of pairs ( 4 , 1 ) , ( 5 , 3 ) , ( 9 , 4 ) , ( 1 , 2 ) , ( 2 , 5 ) .

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 2n 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.

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
using namespace std;
struct P
{
	int length,weight;
}data[5010];
int f[5010];              //记录weight的最长不下降子序列
bool comp(struct P a,struct P b)   //这个处理不到位容易WA，第一关键字相等的时候必须按照第二关键字的升序排列
{
	if (a.length==b.length)
	{
		return a.weight<b.weight;
	}
	else
	{
		return a.length<b.length;
	}
}
int main()
{
	int T,n;
	cin>>T;
	while(T--)
	{
		memset(data,0,sizeof(data));
		memset(f,0,sizeof(f));
		cin>>n;
		for(int i=1;i<=n;i++)
		  cin>>data[i].length>>data[i].weight;
		sort(data+1,data+n+1,comp);
		for(int i=1;i<=n;i++)
		{
			f[i]=1;
			for(int j=1;j<i;j++)
			  if(data[j].weight>data[i].weight&&f[i]<f[j]+1)
			  	f[i]=f[j]+1;
		}
		int MAXX=0;
		for(int i=1;i<=n;i++)
		    MAXX=max(MAXX,f[i]);
		cout<<MAXX<<endl;
	}
	return 0;
}