wdcxc的专栏

思路：kruskal#include<string.h> #include<iostream> #include<cstdio> #include<vector> #include<algorithm> #include<string.h> #include<utility> using namespace std;vector<pair<int, int> > edge[200]; bool u

#include<iostream> #include<vector> #include<algorithm> #include<string.h> #include<utility> #include<iomanip> using namespace std;vector<pair<int, double>> edge[110]; bool used[110]; double perc[110];

多源点最短路，floyd#include<iostream> #include<vector> #include<cstdio> using namespace std;int map[25][25];void floyd() { for (int k = 1; k <= 20; k++) for (int i = 1; i <= 20; i++) f

#include<cstdio> #include<iostream> #include<vector> #include<string.h> using namespace std;struct edge{ int npos, dis, cost; };vector<edge> edges[2010]; pair<int, int> res[2010]; bool used[2010];v

思路：floyd#include<iostream> #include<string.h> #include<vector> #include<algorithm> using namespace std;vector<int> pathcost[10000]; vector<int> pre[10000]; vector<int> cost[10000]; vector<int> citycost