POJ-1042 Gone Fishing (贪心法求最佳钓鱼方案

最新推荐文章于 2020-04-17 14:40:12 发布

外出散步

最新推荐文章于 2020-04-17 14:40:12 发布

阅读量3k

点赞数 2

CC 4.0 BY-SA版权

分类专栏：贪心文章标签：算法贪心

本文链接：https://blog.youkuaiyun.com/harrypoirot/article/details/25073835

本篇博客介绍POJ-1042 Gone Fishing问题，这是一个贪心算法的应用实例。解题思路是每次都选择收益最大的湖泊钓鱼，关键在于理解和计算路上花费的时间。通过对比不同钓鱼方案，证明了贪心策略的正确性。最后提供了代码实现。

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

Gone Fishing

Time Limit: 2000MS		Memory Limit: 32768K
Total Submissions: 28075		Accepted: 8371

Description

John is going on a fishing trip. He has h hours available (1 <= h <= 16), and there are n lakes in the area (2 <= n <= 25) all reachable along a single, one-way road. John starts at lake 1, but he can finish at any lake he wants. He can only travel from one lake to the next one, but he does not have to stop at any lake unless he wishes to. For each i = 1,...,n - 1, the number of 5-minute intervals it takes to travel from lake i to lake i + 1 is denoted ti (0 < ti <=192). For example, t3 = 4 means that it takes 20 minutes to travel from lake 3 to lake 4. To help plan his fishing trip, John has gathered some information about the lakes. For each lake i, the number of fish expected to be caught in the initial 5 minutes, denoted fi( fi >= 0 ), is known. Each 5 minutes of fishing decreases the number of f