摘要:
A.Minimum’s Revenge There is a graph of n vertices which are indexed from 1 to n. For any pair of different vertices, the weight of the edge between t 阅读全文
摘要:
https://pintia.cn/problem-sets/994805046380707840/problems/994805051153825792 本题要求你实现一个天梯赛专属在线地图,队员输入自己学校所在地和赛场地点后,该地图应该推荐两条路线:一条是最快到达路线;一条是最短距离的路线。题目 阅读全文