杭电1051 Wooden Sticks

Wooden Sticks

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

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: 1052 1045 1053 1789 1257 

不仅使用了贪心，按木棒的长度使用贪心算法，然后再使用动态规划，计算重量w的单调递增子序列的个数所求，但是这个单调递增子序列不一定是最长的

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct Stick {
	int l,w;
};
Stick stick[5100];
bool cmp(Stick a,Stick b)
{
	if(a.l==b.l)
	return a.w<b.w;
	else
	return a.l<b.l;
}
int main()
{
	int t,n;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		for(int i=0;i<n;i++)
		scanf("%d%d",&stick[i].l,&stick[i].w);
		sort(stick,stick+n,cmp);
		int b[5100];        \\表示木棒分组的序号
		memset(b,0,sizeof(b));
		b[0]=1;
		for(int i=1;i<n;i++)    \\计算第i个木棒的分组序号
		{
			int k=0;
	     for(int j=0;j<i;j++)     \\在i的前面，比stick[i]大的单元中找到b的最大值
	     {
	     	if(stick[i].w<stick[j].w&&k<b[j])
	     	k=b[j];
	     }
	     	b[i]=k+1;
		 }
		  int max=b[0];
		  for(int i=0;i<n;i++)
		  if(b[i]>max) max=b[i];
		printf("%d\n",max);
	}
	return 0;
}