poj2485

转自 優YoU http://user.qzone.qq.com/289065406/blog/1299323790

题目是英文，理解起来有点麻烦，意思就是，给你一个点到各个点的距离，要你求出这个最小生成树中最常的那条权值

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int inf=65540;
int dist[501][501];
int n;//村落数量
int prim()
{
	int s=1;
	int m=1;
	bool u[501]={false};
	u[s]=true;
	int min_w;
	int point;
	int max_in_min=0;
	int low_dis[501];
	memset(low_dis,inf,sizeof(low_dis));
	while(true)
	{
		if(m==n)
			break;
		min_w=inf;
		for(int i=2;i<=n;i++)
		{
			if(!u[i] && low_dis[i]>dist[s][i])
				low_dis[i] = dist[s][i];
			if(!u[i] && min_w>low_dis[i])
			{
				min_w = low_dis[i];
				point=i;

			}
		}
		if(max_in_min<min_w)           //寻找最小生成树中的最长路径
			max_in_min = min_w;
		s=point;
		u[s]=true;
		m++;
	}
	return max_in_min;
}

int main()
{
	int test;
	scanf("%d",&test);
	while(test--)
	{
		scanf("%d",&n);
		for(int i=1;i<=n;i++)
			for(int j=1;j<=n;j++)
				scanf("%d",&dist[i][j]);
		printf("%d\n",prim());
	}
	return 0;
}