比较水的一道最小生成树题目,直接用Kruskal算法水过~ #include<stdio.h> #include<string.h> #include<algorithm> using namespace std; const int maxn = 110; const int maxm = maxn*maxn/2; int u[maxm], v[maxm], w[maxm], r[maxm]; int p[maxn]; int n, m; int cmp(const int i, const int j) { return w[i] < w[j]; } int find(int x) { return p[x] == x ? x : (p[x] = find(p[x])); } int kruskal() { int ans = 0; for(int i = 0; i < m; i++) r[i] = i; for(int i = 1; i <= n; i++) p[i] = i; sort(r, r+m, cmp); for(int i = 0; i < m; i++) { int e = r[i]; int x = find(u[e]); int y = find(v[e]); if(x != y) { ans += w[e]; p[x] = y; } } return ans; } #define LOCAL int main() { #ifdef LOCAL freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif while(scanf("%d", &n), n != 0) { m = n*(n-1)/2; for(int i = 0; i < m; i++) scanf("%d%d%d", &u[i], &v[i], &w[i]); printf("%d/n", kruskal()); } return 0; }