因为数组没开够大,RE了两次……把应该用MAXM的开成MAXN了。。。。 N个点,有(N*N-N)/2个边!!
int w[MAXM], u[MAXM], v[MAXM]; int p[MAXN], r[MAXM];只有并查集的才用MAXN 啊!!
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN = 110, MAXM = (MAXN*MAXN-MAXN)/2;
int N, M;
int w[MAXM], u[MAXM], v[MAXM];
int p[MAXN], r[MAXM];
bool cmp(const int a, const int b){ return w[a] < w[b];}
int find(int x){ return p[x] == x ? x : p[x] = find(p[x]);}
int Kruskal()
{
int ans = 0;
for(int i = 0; i < N; i++) p[i] = i; //初始化并查集
for(int i = 0; i < M; i++) r[i] = i; //初始化边序号
sort(r, r+M, cmp);
for(int i = 0; i < M; i++)
{
int e = r[i], x = find(u[e]), y = find(v[e]);
if(x != y) //不在同一集合
{
ans += w[e];
p[x] = y; //合并
}
}
return ans;
}
int main()
{
while(scanf("%d", &N) != EOF && N)
{
M = 0;
for(int i = 0; i < N; i++)
for(int j = 0; j < N; j++)
{
int weight;
scanf("%d", &weight);
if(j > i)
{
u[M] = i; v[M] = j; w[M++] = weight; //邻接矩阵处理
}
}
printf("%d\n", Kruskal());
}
return 0;
}