POJ 2395

来源：互联网发布：mysql是大型数据库吗编辑：程序博客网时间：2024/04/30 08:53

简单题，很纯粹的最小生成树。

#include<iostream>#include<cstdio>#include<algorithm>using namespace std;class kruskal{public:    int a,b,t;}edge[10010];int n,m;int Max;int f[2010],num[2010];bool cmp(kruskal x,kruskal y){    return x.t < y.t;}int Find(int x){    if(f[x] == x)        return x;    else        f[x] = Find(f[x]);    return f[x];}int Union(int x,int y){    int a = Find(x);    int b = Find(y);    if(a == b)        return 0;    else if(num[a] >= num[b]){        f[b] = a;        num[a] += num[b];    }    else {        f[a] = b;        num[b] += num[a];    }    return 1;}int main(){ //   freopen("in.txt","r",stdin);    cin>>n>>m;    for(int i = 1;i <= n; i++){        f[i] = i;        num[i] = 1;    }    for(int i = 1;i <= m; i++)        cin>>edge[i].a>>edge[i].b>>edge[i].t;    sort(edge+1,edge+m+1,cmp);    Max = 0;    int pos = 1;    for(int i = 1;i <= m; i++){        if(Union(edge[i].a,edge[i].b) == 1){            if(edge[i].t  > Max)                Max = edge[i].t;            pos++;        }        if(pos == n)            break;    }    cout<<Max<<endl;    return 0;}

0 0