POJ 2395

来源：互联网发布：沐足软件编辑：程序博客网时间：2024/05/18 02:19

最小生成树的最大边。用Kruskal实现。

#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int judge[2005][2005];struct edge{    int u,v,cost;};bool cmp(edge a,edge b){    return a.cost<b.cost;}edge e[10050];edge maxleng[10050];int charge[2005];int father[2005];int find(int x){    if(father[x]==x) return x;    else        return father[x]=find(father[x]);}void unite(int x,int y){    int xx=find(x);    int yy=find(y);    if(xx==yy) return;    else        father[xx]=yy;        return;}int same(int x,int y){    if(find(x)==find(y)) return 1;    else        return 0;}int main(){    int n,m;    while(scanf("%d%d",&n,&m)!=EOF){        memset(judge,0,sizeof(judge));        memset(maxleng,0,sizeof(maxleng));        for(int i=1;i<=n;i++) father[i]=i;        for(int i=0;i<m;i++) scanf("%d%d%d",&e[i].u,&e[i].v,&e[i].cost);        sort(e,e+m,cmp);        int max=-1;        int cnt=0;        int i=0;        while(cnt<n-1){            while(i<m&&same(e[i].u,e[i].v)) i++;            if(i==m) break;            if(same(e[i].u,e[i].v)==0) unite(e[i].u,e[i].v);            if(max<e[i].cost) max=e[i].cost;            cnt++;        }        printf("%d\n",max);    }    return 0;}

0 0