POJ-2395-Out of Hay

这个题就是求最小生成树的边权最大值，水题~

代码：

#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;const int maxn=11000;struct Node{    int from;    int to;    int c;    bool operator < (const Node &a)const    {return c<a.c;    }}a[maxn];int n,m,p[maxn];int find(int x){    if(p[x]==-1)return x;    return p[x]=find(p[x]);}int main(){    while(scanf("%d%d",&n,&m)!=EOF)    {memset(p,-1,sizeof(p));for(int i=0;i<m;i++)    scanf("%d%d%d",&a[i].from,&a[i].to,&a[i].c);sort(a,a+m);int ans=0;for(int i=0;i<m;i++){    int x=find(a[i].from);    int y=find(a[i].to);    if(x!=y)    {p[x]=y;ans=a[i].c;    }}printf("%d\n",ans);    }    return 0;}