农夫约翰购买新车时误点了两次额外功能选项，导致车上有两个GPS导航系统，经常给出不同的路线建议。问题在于，确定从他的房子到农场的旅程中，如何使GPS的抱怨次数最小化。地图由N个交叉路口和M条方向道路组成，每个GPS系统对每条道路的行驶时间有不同的估计。目标是找出从1号交叉路口到N号交叉路口的路线，使得两个GPS系统的抱怨总和最小。这个问题可以通过反向构建图并运行最短路径算法来转化为一个经典问题。
题目描述
Farmer John has recently purchased a new car online, but in his haste he accidentally clicked the "Submit" button twice when selecting extra features for the car, and as a result the car ended up equipped with two GPS navigation systems! Even worse, the two systems often make conflicting decisions about the route that FJ should take.
The map of the region in which FJ lives consists of N intersections (2 <= N <= 10,000) and M directional roads (1 <= M <= 50,000). Road i connects intersections A_i (1 <= A_i <= N) and B_i (1 <= B_i <= N). Multiple roads could connect the same pair of intersections, and a bi-directional road (one permitting two-way travel) is represented by two separate directional roads in opposite orientations. FJ's house is located at intersection 1, and his farm is located at i
最低0.47元/天 解锁文章
扫一扫
709
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
