pku 2395 Out of Hay

http://acm.pku.edu.cn/JudgeOnline/problem?id=2395

题意：是求出最小生成树的最大边。

PS:注意有重边。

#include <cstdio>
#include <iostream>

using namespace std;

int n,m;
long map[2010][2010];
int dis[2010];
bool intree[2010];

void Read()
{
	int i,j;
	int a,b;
	long l;
	for(i = 1;i <= n;i ++)
	{
		for(j = 1;j <= n;j ++)
			map[i][j] = 1000000010;
	}
	for(i = 0;i < m;i ++)
	{
		scanf("%d%d%ld",&a,&b,&l);
		if(l < map[a][b] || map[a][b] == 1000000010)
		{
			map[a][b] = l;
			map[b][a] = map[a][b];
		}
	}
	for(i = 1;i <= n;i ++)
	{
		dis[i] = 1000000010;
		intree[i] = false;
	}
	intree[1] = true;
	for(i = 1;i <= n;i ++)
		dis[i] = map[1][i];
}

void Prim()
{
	int i,j,loc;
	long max = 0,min;
	for(i = 1;i < n;i ++)
	{
		min = 1000000010;
		for(j = 1;j <= n;j ++)
		{
			if(intree[j] == false && min > dis[j])
			{
				min = dis[j];
				loc = j;
			}
		}
		if(max < min)
			max = min;
		intree[loc] = true;
		for(j = 1;j <= n;j ++)
		{
			if(intree[j] == false)
			{
				if(dis[j] > map[loc][j])
					dis[j] = map[loc][j];
			}
		}
	}
	printf("%ld/n",max);
}

int main()
{
	while(scanf("%d%d",&n,&m) != EOF)
	{
		Read();
		Prim();
	}
	return 0 ;
}

/*

3 3
1 2 23
2 3 1000
1 3 43

43

*/