这是一篇关于算法笔记的文章，聚焦于如何使用贪心策略来解决一个问题：修复一个长为L英寸的矩形裂缝。用户Kitty有N个宽度为1英寸的矩形木块，每块木块的长度不同，目标是用最少数量的木块无间隙地填补裂缝。题目要求找出最小的木块数量以完成修复，如果无法修复则输出"impossible"。文章包含输入输出格式及样例，并提出通过排序木块长度并依次填充的方法来优化解决方案。
题目链接：http://codeup.cn/problem.php?cid=100000584&pid=3
题目描述
Long time ago , Kitty lived in a small village. The air was fresh and the scenery was very beautiful. The only thing that troubled her is the typhoon.
When the typhoon came, everything is terrible. It kept blowing and raining for a long time. And what made the situation worse was that all of Kitty's walls were made of wood.
One day, Kitty found that there was a crack in the wall. The shape of the crack is
a rectangle with the size of 1×L (in inch). Luckly Kitty got N blocks and a saw(锯子) from her neighbors.
The shape of the blocks were rectangle too, and the width of all blocks were 1 inch. So, with the help of saw, Kitty could cut down some of the blocks(of course she could use it directly without cutting) and put them in the crack, and the wall may be repa
最低0.47元/天 解锁文章
6249
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
