HDU-1051 Wooden Sticks

                                                    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1051

                                                                               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

题意:

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

解题思路:

先进行排序,若长度不等,则将长度按从小到大的顺序排,若长度相等,则按重量从小到大的顺序排序,之后从第一根木棍开始,一次找符合条件的,找到之后以此重量接着找符合条件的,以此类推,注意最后一组有没有计算进去。

代码:

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
struct wooden
{
	int l;
	int w;
}q[10010];

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

int main()
{
	int t,n,i,j,count,w0;
	int vis[10010];
	scanf("%d",&t);
	while(t--)
	{
		count=0;
		scanf("%d",&n);
		for(i=0;i<n;i++)
			scanf("%d%d",&q[i].l,&q[i].w);
		sort(q,q+n,cmp);
		/*for(i=0;i<n;i++)
			printf("%d %d\n",q[i].l,q[i].w);*/
		memset(vis,0,sizeof(vis));
		for(i=0;i<n-1;i++)
		{
			if(vis[i]==1)
				continue;
			count++; 
			vis[i]=1;
			w0=q[i].w;
			for(j=i+1;j<n;j++)
			{
				if(vis[j]==0&&q[j].w>=w0)
				{
					vis[j]=1;
					w0=q[j].w;
				}
			}
		}
		if(vis[n-1]==0)
			count++;
		printf("%d\n",count);
	}
	return 0;
}  

 

Python网络爬虫与推荐算法新闻推荐平台:网络爬虫:通过Python实现新浪新闻的爬取,可爬取新闻页面上的标题、文本、图片、视频链接(保留排版) 推荐算法:权重衰减+标签推荐+区域推荐+热点推荐.zip项目工程资源经过严格测试可直接运行成功且功能正常的情况才上传,可轻松复刻,拿到资料包后可轻松复现出一样的项目,本人系统开发经验充足(全领域),有任何使用问题欢迎随时与我联系,我会及时为您解惑,提供帮助。 【资源内容】:包含完整源码+工程文件+说明(如有)等。答辩评审平均分达到96分,放心下载使用!可轻松复现,设计报告也可借鉴此项目,该资源内项目代码都经过测试运行成功,功能ok的情况下才上传的。 【提供帮助】:有任何使用问题欢迎随时与我联系,我会及时解答解惑,提供帮助 【附带帮助】:若还需要相关开发工具、学习资料等,我会提供帮助,提供资料,鼓励学习进步 【项目价值】:可用在相关项目设计中,皆可应用在项目、毕业设计、课程设计、期末/期中/大作业、工程实训、大创等学科竞赛比赛、初期项目立项、学习/练手等方面,可借鉴此优质项目实现复刻,设计报告也可借鉴此项目,也可基于此项目来扩展开发出更多功能 下载后请首先打开README文件(如有),项目工程可直接复现复刻,如果基础还行,也可在此程序基础上进行修改,以实现其它功能。供开源学习/技术交流/学习参考,勿用于商业用途。质量优质,放心下载使用。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值