博客介绍了如何运用优先队列和贪心策略解决poj 2431 Expedition问题。该问题涉及一辆车从起点出发，途经多个加油站，需要确定最少加油次数以到达终点。由于01背包和图论方法不适合，作者提出按加油站距离排序，利用贪心策略选取能到达的加油站中油量最多的进行加油，直至油量足以抵达终点。此方法适用于nlogn级别的数据规模。
| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 10700 | Accepted: 3117 |
Description
A group of cows grabbed a truck and ventured on an expedition deep into the jungle. Being rather poor drivers, the cows unfortunately managed to run over a rock and puncture the truck's fuel tank. The truck now leaks one unit of fuel every unit of distance it travels.
To repair the truck, the cows need to drive to the nearest town (no more than 1,000,000 units distant) down a long, winding road. On this
To repair the truck, the cows need to drive to the nearest town (no more than 1,000,000 units distant) down a long, winding road. On this
最低0.47元/天 解锁文章
扫一扫
276
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
