2550852_re.cpp

北大大牛代码 1240道题的原代码 超级权威

# include <iostream.h>
# include <stdio.h>
# include <stdlib.h>

# define MAXV 501
# define MAXE 500*251

typedef struct enode
{
	int v1;
	int v2;
	int weight;
}Edge;

Edge E[MAXE];
int MSW;

int cmp(const void *a, const void *b)
{
	struct enode *aa = (struct enode *)a;
	struct enode *bb = (struct enode *)b;
	return aa->weight-bb->weight;
}

void kruskal(Edge E[], int n, int e)
{
	int i, k, j;
	int m1, m2, sn1, sn2;
	int vest[MAXV];

	for(i = 0; i < n; i++)
		vest[i] = i;
	k = 1;
	j = 0;
	while(k < n)
	{
		m1 = E[j].v1; m2 = E[j].v2;
		sn1 = vest[m1]; sn2 = vest[m2];
		if(sn1!=sn2)
		{
			k++;
			MSW = E[j].weight;
			for(i = 0; i < n; i++)
				if(vest[i]==sn2)
					vest[i] = sn1;
		}
		j++;
	}
}


int main()
{
	int i, j;
	int t, tmp;
	int n, e;

	cin>>t;
	while(t--)
	{
		cin>>n;
		{
			e = 0;
			for(i = 0; i < n; i++)
				for(j = 0; j < n; j++)
				{
					scanf("%d",&tmp);
					if(i<j)
					{
						E[e].v1 = i,E[e].v2 = j;
						E[e].weight = tmp;e++;
					}
				}
			MSW = 0;
			qsort(E,e,sizeof(E[0]),cmp);
			kruskal(E,n,e);
			cout<<MSW<<endl;
		}
	}
	return 1;
}