POJ 2485 Highways(最小生成树)
http://poj.org/problem?id=2485
题意:
给你一个N个节点的无向图,以及它的距离矩阵.现在要你求该图的最小生成树,并输出该树中最长边的长度.
分析:
直接构建最小生成树,并输出最后一条加入生成树的边即可.(我这里用的kruskal算法)
AC代码:
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=500+10;
const int maxm=500*500+10;
struct Edge
{
int u,v,dist;
Edge(){}
Edge(int u,int v,int d):u(u),v(v),dist(d){}
bool operator<(const Edge &rhs)const
{
return dist<rhs.dist;
}
};
struct Kruskal
{
int n,m;
Edge edges[maxm];
int fa[maxn];
int findset(int x){ return fa[x]==-1? x: fa[x]=findset(fa[x]); }
void init(int n)
{
this->n=n;
m=0;
memset(fa,-1,sizeof(fa));
}
void AddEdge(int u,int v,int dist)
{
edges[m++]=Edge(u,v,dist);
}
int kruskal()//范围生成树中最长边的值
{
int sum=0;
int cnt=0;
sort(edges,edges+m);
for(int i=0;i<m;i++)
{
int u=edges[i].u, v=edges[i].v;
if(findset(u) != findset(v))
{
sum += edges[i].dist;
fa[findset(u)] = findset(v);
if(++cnt>=n-1) return edges[i].dist;
}
}
return -1;
}
}KK;
int main()
{
int T; scanf("%d",&T);
while(T--)
{
int n;
scanf("%d",&n);
KK.init(n);
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
{
int dist;
scanf("%d",&dist);
if(i<j)
{
KK.AddEdge(i,j,dist);
}
}
printf("%d\n",KK.kruskal());
}
return 0;
}