注意：Floyd是求图里面任意两个点x，y之间的最短距离 #include <cstring>#include <iostream>#include <algorithm>using namespace std;const int N = 210, INF = 1e9;int n, m, Q;int d[N][N];void floyd(){//枚举1~k个中间节点，尝试通过这几个