HDU2433-预处理优化

最新推荐文章于 2024-06-29 00:43:15 发布

Raise

最新推荐文章于 2024-06-29 00:43:15 发布

阅读量2.2k

点赞数

CC 4.0 BY-SA版权

分类专栏： C++ 文章标签： bfs

本文链接：https://blog.csdn.net/linraise/article/details/42155947

这是一篇关于利用BFS优化解决图论问题的文章，讨论了如何在图中删除一条边后计算总最短路径变化的问题。文章通过分析，指出当边不是最小生成树的树边或重边时，可以不重新计算，从而减少了复杂度。在最坏情况下，需要重新进行BFS以更新最小生成树。

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

Travel

Time Limit: 10000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1782 Accepted Submission(s): 601

Problem Description

One day, Tom traveled to a country named BGM. BGM is a small country, but there are N (N <= 100) towns in it. Each town products one kind of food, the food will be transported to all the towns. In addition, the trucks will always take the shortest way. There are M (M <= 3000) two-way roads connecting the towns, and the length of the road is 1.
Let SUM be the total distance of the shortest paths between all pairs of the towns. Please write a program to calculate the new SUM after one of the M roads is destroyed.

Input

&nbs