POJ2395 Out of Hay 最小生成树

最新推荐文章于 2022-09-29 17:30:11 发布

nextcy

最新推荐文章于 2022-09-29 17:30:11 发布

阅读量526

点赞数

分类专栏： ACM 文章标签： struct integer each output input c

本文链接：https://blog.csdn.net/chaiyuan414/article/details/4972569

版权

ACM 专栏收录该内容

52 篇文章 0 订阅

订阅专栏

Out of Hay

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 4697		Accepted: 1681

Description

The cows have run out of hay, a horrible event that must be remedied immediately. Bessie intends to visit the other farms to survey their hay situation. There are N (2 <= N <= 2,000) farms (numbered 1..N); Bessie starts at Farm 1. She'll traverse some or all of the M (1 <= M <= 10,000) two-way roads whose length does not exceed 1,000,000,000 that connect the farms. Some farms may be multiply connected with different length roads. All farms are connected one way or another to Farm 1.

Bessie is trying to decide how large a waterskin she will need. She knows that she needs one ounce of water for each unit of length of a road. Since she can get more water at each farm, she's only concerned about the length of the longest road. Of course, she plans her route between farms such that she minimizes the amount of water she must carry.

Help Bessie know the largest amount of water she will ever have to carry: what is the length of longest road she'll have to travel between any two farms, presuming she chooses routes that minimize that number? This means, of course, that she might backtrack over a road in order to minimize the length of the longest road she'll have to traverse.

Input

* Line 1: Two space-separated integers, N and M.

* Lines 2..1+M: Line i+1 contains three space-separated integers, A_i, B_i, and L_i, describing a road from A_i to B_i of length L_i.

Output

* Line 1: A single integer that is the length of the longest road required to be traversed.

Sample Input

Sample Output

对于这题不说什么了   就是普里姆+并查集    程序如下：

#include<iostream>
#include<cstring>
#include<stdlib.h>
using namespace std;
struct node
{
       int a,b;
       int dis;
}d[10001];
int father[2001];
int getfather(int t)
{
    while(t!=father[t])
       t=father[t];
    return t;
}                               
void createfather(int g,int h)
{
     int root1=getfather(g);
     int root2=getfather(h);
     father[root1]=root2;
}
int cmp(const void *a1,const void *b1)
{
    struct node *aa=(struct node *)a1;
    struct node *bb=(struct node *)b1;
    return aa->dis-bb->dis;
}
int main()
{
    int n,m;
    while(cin>>n>>m)
    {
          int i,j,c=0;
          for(i=1;i<=m;i++)
          {
               cin>>d[i].a>>d[i].b>>d[i].dis;
          }
          for(i=1;i<=n;i++)  father[i]=i;
          qsort(d,m+1,sizeof(d[0]),cmp);
          for(i=1;i<=m;i++)
          {
              if(getfather(d[i].a)==getfather(d[i].b))  continue;
              createfather(d[i].a,d[i].b);
              c++;
              if(c==n-1)  
              {
                      cout<<d[i].dis<<endl;
                      break;
              }
          }
    }
    return 0;
}