排序

最新推荐文章于 2024-11-28 13:35:01 发布

ZCY19990813

最新推荐文章于 2024-11-28 13:35:01 发布

阅读量185

点赞数 2

CC 4.0 BY-SA版权

分类专栏： ACM程序设计基础

本文链接：https://blog.youkuaiyun.com/ZCY19990813/article/details/83009622

ACM程序设计基础专栏收录该内容

40 篇文章 ¥9.90 ¥99.00

订阅专栏

农场主John需要修复围栏，购买了一块长木板，需要锯成N块，每块长度不同。Don农场主提供锯子服务，按木材长度收费。任务是帮助John确定最节省成本的锯木头顺序，输出最小总花费。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Fence Repair（优先队列）每一次都排序

Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needs N (1 ≤ N ≤ 20,000) planks of wood, each having some integer length Li (1 ≤ Li ≤ 50,000) units. He then purchases a single long board just long enough to saw into the N planks (i.e., whose length is the sum of the lengths Li). FJ is ignoring the "kerf", the extra length lost to sawdust when a sawcut is made; you should ignore it, too.

FJ sadly realizes that he doesn't own a saw with which to cut the wood, so he mosies over to Farmer Don's Farm with this long board and politely asks if he

了解本专栏