1595 find the longest of the shortest(最短路Dijkstra+枚举删

Each case there are two numbers in the first row, N and M, separated by a single space, the number of towns,and the number of roads between the towns. 1 ≤ N ≤ 1000, 1 ≤ M ≤ N*(N-1)/2. The cities are markedwith numbers from 1 to N, Mirko is located in city 1, and Marica in city N. In the next M lines are three numbers A, B and V, separated by commas. 1 ≤ A,B ≤ N, 1 ≤ V ≤ 1000.Those numbers mean that there is a two-way road between cities A and B, and that it is crossable in V minutes.

,有理想在的地方,地狱就是天堂

1595 find the longest of the shortest(最短路Dijkstra+枚举删

相关文章:

你感兴趣的文章:

标签云: