HDU 1051 Wooden Sticks

Wooden Sticks

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

 

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

 

 

Source

Asia 2001, Taejon (South Korea)

 

 

Recommend

We have carefully selected several similar problems for you:  1050 1052 1045 1053 1003 

 

题意：有n个木板，第一个木板要耗时一分钟，之后所有比前面的木板的长和宽大的不需要耗费时间，否则要多耗费一分钟，问这n个木板最少耗费多少时间；

思路：DP,用dp[i]表示第i个木板前有多少个新的起点；

代码：

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#define long long LL;
#define INF 0x3f3f3f3f
#define PI acos(-1.0)
using namespace std;
int dp[5050];
struct node{
	int l,w;
}a[5050];
bool cmp(node A,node B)
{
	if(A.l!=B.l)
		return A.l<B.l;
	return A.w<B.w;
 } 
int main()
{
	int t,n;
	cin>>t;
	while(t--)
	{
		memset(a,0,sizeof(a));
		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=0;i<n;i++)
			for(int j=0;j<i;j++)
				if(a[i].w<a[j].w&&dp[i]<dp[j]+1)
					dp[i]=dp[j]+1;
		sort(dp,dp+n);
		printf("%d\n",dp[n-1]);
	}
    return 0;
}