class Solution {public: int networkDelayTime(vector<vector<int>>& times, int n, int k) { int inf=INT_MAX/2; vector<
Floyd求最短路径原题链接#include<iostream>#include<cstring>using namespace std;const int N=210,M=20010,INF=0x3f3f3f3f;int g[N][N];int n,m,Q;int main