博客探讨了HDU-2433 Travel问题，涉及多组输入和边数的最短路径计算。内容指出，仅删除一条边时，某些两点间最短路径会发生变化。文章讨论了通过记录路径和不记录路径的两种方法，并提到了一种使用used矩阵来跟踪路径状态的高效解决方案，以避免超时错误。
Travel
Time Limit: 10000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
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.
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
最低0.47元/天 解锁文章
451
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
