It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that c ...
分类：
其他好文 时间：
2018-09-06 18:09:18
阅读次数：
177
With highways available, driving a car from Hangzhou to any other city is easy. But since the tank capacity of a car is limited, we have to find gas s ...
分类：
其他好文 时间：
2018-09-05 21:58:11
阅读次数：
249
题目链接： http://poj.org/problem?id=2485 题目： Highways Description The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public h ...
分类：
其他好文 时间：
2018-08-26 10:24:30
阅读次数：
179
基尔霍夫矩阵 https://blog.csdn.net/w4149/article/details/77387045 https://blog.csdn.net/qq_29963431/article/details/51236064 题目链接 https://vjudge.net/problem ...
分类：
其他好文 时间：
2018-08-20 23:00:31
阅读次数：
214
It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that c ...
分类：
其他好文 时间：
2018-08-19 19:05:18
阅读次数：
147
It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that c ...
分类：
其他好文 时间：
2018-08-14 18:58:52
阅读次数：
130
A traveler's map gives the distances between cities along the highways, together with the cost of each highway. Now you are supposed to write a progra ...
分类：
其他好文 时间：
2018-08-09 21:15:04
阅读次数：
114
https://vjudge.net/problem/POJ-2485 题意 n个城市，城市之间的距离已给出，现在要建立城市间互通的高速公路，问建成的高速公路中，边权最大的最小值是多少。 分析 首先这个通路一定是个树，其次，考虑怎么找到边权最大的最小值，可以利用最小生成树。因为最小生成树是求生成树的 ...
分类：
其他好文 时间：
2018-06-29 11:14:41
阅读次数：
126
A traveler's map gives the distances between cities along the highways, together with the cost of each highway. Now you are supposed to write a progra ...
分类：
其他好文 时间：
2018-06-13 21:45:47
阅读次数：
195
问题描述 Highways Time Limit: 1000MS Memory Limit: 65536K Description The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no publ ...
分类：
其他好文 时间：
2018-06-13 12:02:05
阅读次数：
198
