ACM--木头序列--贪心+递减子序列--HDOJ 1051--Wooden Sticks

最新推荐文章于 2017-08-24 10:27:51 发布

学霸的一天

最新推荐文章于 2017-08-24 10:27:51 发布

阅读量3.8k

点赞数 1

分类专栏： ACM算法 ACM刷题录文章标签： ACM 贪心递减子序列 HDOJ 1051 Wooden Sticks

本文链接：https://blog.csdn.net/qq_26891045/article/details/51531228

版权

博客介绍了如何使用贪心策略和递减子序列解决HDOJ 1051 Wooden Sticks问题。通过将木头按长度和重量降序排列，找到能连续处理的递减子序列，从而确定最小机器调试时间。

摘要由CSDN通过智能技术生成

HDOJ题目地址：传送门

Wooden Sticks

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 17453 Accepted Submission(s): 7121

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<&