2820509_ac_296ms_664k.c

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

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

# define MAXV 1001
# define MAXE 100001

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

Edge E[MAXE];
int ans;

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

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

	for(i = 0; i < n; i++)
		vest[i] = i;
	j = 0;
	while(vest[0]!=vest[n-1])
	{
		m1 = E[j].v1; m2 = E[j].v2;
		sn1 = vest[m1]; sn2 = vest[m2];
		ans = E[j].weight;
		if(sn1!=sn2)
		{
			for(i = 0; i < n; i++)
				if(vest[i]==sn2)
					vest[i] = sn1;
		}
		j++;
	}
	printf("%d\n\n",ans);
}

void get_graph(int e)
{
	int i;
	int a, b, w;

	for (i = 0; i < e; i++)
	{
		scanf("%d%d%d",&a,&b,&w);
		a--,b--;
		E[i].v1 = a;
		E[i].v2 = b;
		E[i].weight = w;
	}
}

int main()
{
	int cas, num;
	int n, e;

	cas = 1;
	scanf("%d",&num);
	while(num--)
	{
		printf("Scenario #%d:\n",cas++);
		scanf("%d%d",&n,&e);
		get_graph(e);
		qsort(E,e,sizeof(E[0]),cmp);
		kruskal(E,n,e);
	}
	return 1;
}