Wooden Sticks（贪心）-HDU

最新推荐文章于 2022-04-04 08:55:18 发布

原创最新推荐文章于 2022-04-04 08:55:18 发布 · 365 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

本文探讨了一种木棍加工的优化问题，通过合理的排序和选择策略，实现最小化机器调整时间的目标。文章提供了详细的算法思路，包括对木棍长度和重量的排序方法，以及如何通过遍历序列找到满足条件的木棍序列，最终计算出总的最小调整时间。

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

题意：给定n根木棍，以及每根木棍的长度 l 和重量 w 。现在要对它们进行加工，机器调整时间为1分钟，如果加工完一根长 l 重w 的木棍后，下一根长 l' 重 w' 的木棍满足l≤l′且w≤w′，那么机器就可以继续加工而不需要进入调整时间。否则的话，又需要1分钟的调整时间才能继续加工。求总共最小需要的调整时间。

分析：首先可以对重量或者长度进行排序，降序升序都可以。以我的代码为例，是对长度l进行从小到大的排序，如果l相等时，按重量w从小到大排序。然后遍历这个序列，如果满足w≤w′，我们就把这个木棍的下标记下来，去找下一个满足条件的木棍。在这个过程中，用一个数组book，来标记此根木棍是否已经被访问。

#include<iostream>
#include<algorithm>
using namespace std;

struct node
{
	int l;
	int w;
}a[5005];

bool cmp(node a,node b)
{
	if(a.l != b.l)
		return a.l < b.l;
	else
		return a.w < b.w;
}

int main()
{
	int i,j,t,n,ans,min;
	int book[5005];
	scanf("%d",&t);
	while(t --)
	{
		ans = 0;
		scanf("%d",&n);
		for(i = 0; i < n; i ++)
		{
			scanf("%d%d",&a[i].l,&a[i].w);
			book[i] = 0;
		}
		sort(a,a+n,cmp);
		for(i = 0; i < n; i ++)
		{
			if(book[i] == 1)
				continue;
			min = a[i].w;
			for(j = i+1; j < n; j ++)
			{
				if(book[j] == 0 && min <= a[j].w)
				{
					book[j] = 1;
					min = a[j].w;
				}
			}
			ans ++;
		}
		printf("%d\n",ans);
	}
	return 0;
}