poj 3635 Full Tank? ( bfs+dp思想 )

最新推荐文章于 2020-01-31 15:50:25 发布

utobe67

最新推荐文章于 2020-01-31 15:50:25 发布

阅读量1.6k

点赞数 1

CC 4.0 BY-SA版权

分类专栏： dp 搜索

本文链接：https://blog.youkuaiyun.com/tobewhatyouwanttobe/article/details/12657221

该博客探讨了如何使用BFS结合DP策略解决一个图论问题：在有限油量和油价的情况下，从s到e的最小费用路径。通过建立dp[i][j]表示到达节点i时剩余油量j的最小花费，并利用堆优化BFS进行状态转移，找到了有效状态并求得最小花费。此方法类似于优先队列优化的最短路径问题。

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

Full Tank?

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 5857		Accepted: 1920

Description

After going through the receipts from your car trip through Europe this summer, you realised that the gas prices varied between the cities you visited. Maybe you could have saved some money if you were a bit more clever about where you filled your fuel?

To help other tourists (and save money yourself next time), you want to write a program for finding the cheapest way to travel between cities, filling your tank on the way. We assume that all cars use one unit of fuel per unit of distance, and start with an empty gas tank.