题意直接有道翻译 思路：Floyd算法计算出任意两点之间最短路径，遍历每一个点，计算路径和，取最小值 #include <cstdio>#include <iostream>#include <algorithm>#include <cstring>#include <string>#include <queue>#include <cmath>#include <fstream