Out of Hay POJ - 2395

大致题意：就是农场的牛跑了，现在牧人要去抓牛，但是从目前到牛的地方有很多条路，现在让你走最短路径，就是最小生成树，然后取最小生成树里面的最大边

大致思路：我用的prim算法，其实就是prim算法的模版，就是加了个更新最大边，每加入生成树一条边，就更新最大边；

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

3 3
1 2 23
2 3 1000
1 3 43

Sample Output

43

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
#define inf 0x3f3f3f3f
int n,m,i,j,k,t1,t2,t3;
int e[2010][2010],dis[2010],book[2010];
void prim()
{
    int max=0,cot=0;
    for(i=1; i<=n; i++)
    {
        dis[i]=e[1][i]; //初始化dis数组，
        book[i]=0;
    }
    book[1]=1;
    dis[1]=0;
    for(i=1; i<n; i++)
    {
        k=0;
        int min=inf;
        for(j=1; j<=n; j++)
        {
            if(book[j]==0&&dis[j]<min)
            {
                min=dis[j];
                k=j;
            }
        }
        book[k]=1;    //标记是否已加入生成树
        if(max<min)max=min;//更新最小值
        //扫描当前顶点J的所有边，再以j为中间点，更新生成树到每一个非树顶点的距离
        for(j=1; j<=n; j++)
        {
            if(book[j]==0&&dis[j]>e[k][j])
            {
                dis[j]=e[k][j];
            }
        }
    }
    printf("%d\n",max);
}
int main()
{
    scanf("%d%d",&n,&m);
    int a,b,l;
    for(i=1; i<=n; i++)
        dis[i]=inf;
    for(i=0; i<=n; i++)
        for(j=1; j<=n; j++)
            if(i==j)e[i][j]=0;
            else e[i][j]=inf;
    for(i=1; i<=m; i++)
    {
        scanf("%d%d%d",&a,&b,&l);
        if(l<e[a][b])   //同一个目的地，可能有不同的路径，所以要更新最小路径
            e[a][b]=e[b][a]=l;
    }
    prim();
    return 0;
}