最短路专题2 | CodeForces 449B - SPFA算法

最新推荐文章于 2025-07-05 15:45:34 发布

ACM算法日常

最新推荐文章于 2025-07-05 15:45:34 发布

阅读量1.7k

点赞数

CC 4.0 BY-SA版权

分类专栏：算法 ACM算法最短路SPFA

本文链接：https://blog.csdn.net/qq_41551359/article/details/103692674

本文介绍了如何使用SPFA算法解决CodeForces中关于最短路径的问题，总统Jzzhu希望关闭一些铁路线路但保持所有城市到首都的最短路径不变。文章详细讲解了SPFA算法的思路、优化策略，并提供了C++源代码示例。此外，还讨论了如何用Dijkstra算法解决相同问题。

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

最短路专题2 | CodeForces 449B - SPFA算法

B. Jzzhu and Cities

Jzzhu is the president of country A. There are n cities numbered from 1 to n in his country. City 1 is the capital of A. Also there are m roads connecting the cities. One can go from city $u_i$ to $v_i$ (and vise versa) using the $i$ -th road, the length of this road is $x_i$ . Finally, there are k train routes in the country. One can use the $i$ -th train route to go from capital of the country to city $s_i$ (and vise versa), the length of this route is $y_i$ .
J是A国的总统，这个国家有n个城市。1是首都，有m条公路连接这些城市。然后，有k个火车线。城市 $s_i$ 到首都1的距离是 $y_i$ 。

Jzzhu doesn’t want to waste the money of the country, so he is going to close some of the train routes. Please tell Jzzhu the maximum number of the train routes which can be closed under the following condition: the length of the shortest path from every city to the capital mustn’t change.
J不想浪费钱，删除部分铁路，但是每个城市到达首都的最短路径不能被修改，也就是说，只有最短路径不经过这个铁路时，才可以删除。