poj2485 Highways : http://poj.org/problem?id=2485
最小生成树输出最大边权
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN = 510;
const int INF = 0x3f3f3f3f;
int map[MAXN][MAXN];
int n;
int visit[MAXN];
inline int Min(int a, int b)
{
return a > b? b : a;
}
int prim(void)
{
int ans = 0;
int lowcost[MAXN];
memset(visit,0,sizeof(visit));
for