[Usaco2005 Mar]Out of Hay 干草危机

1682: [Usaco2005 Mar]Out of Hay 干草危机

Time Limit: 5 Sec  Memory Limit: 64 MB Submit: 633  Solved: 440 [Submit][Status][Discuss]

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.

 

    牛们干草要用完了！贝茜打算去勘查灾情．

    有N(2≤N≤2000)个农场，M(≤M≤10000)条双向道路连接着它们，长度不超过109．每一个农场均与农场1连通．贝茜要走遍每一个农场．她每走一单位长的路，就要消耗一单位的水．从一个农场走到另一个农场，她就要带上数量上等于路长的水．请帮她确定最小的水箱容量．也就是说，确定某一种方案，使走遍所有农场通过的最长道路的长度最小，必要时她可以走回头路．

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.

    第1行输入两个整数N和M;接下来M行，每行输入三个整数，表示一条道路的起点终点和长度．

   

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

由1到达2，需要经过长度23的道路；回到1再到3，通过长度43的道路．最长道路为43

 

最小生成树

#include <set>
#include <cstdio>
#include <algorithm>
using namespace std; 
char buf[10000000], *ptr = buf - 1;
inline int readint(){
    int n = 0;
    char ch = *++ptr;
    while(ch < '0' || ch > '9') ch = *++ptr;
    while(ch <= '9' && ch >= '0'){
        n = (n << 1) + (n << 3) + ch - '0';
        ch = *++ptr;
    }
    return n;
}
const int maxn = 2000 + 10, maxm = 10000 + 10;
int fa[maxn];
int Find(int x){
    return x == fa[x] ? x : fa[x] = Find(fa[x]);
}
struct Edge{
    int u, v, w;
    Edge(){}
    Edge(int _u, int _v, int _w): u(_u), v(_v), w(_w){}
    bool operator < (const Edge &x) const {
        return w < x.w;
    }
}e[maxm];
int main(){
    fread(buf, sizeof(char), sizeof(buf), stdin);
    int n, m;
    n = readint();
    m = readint();
    for(int i = 1; i <= n; i++) fa[i] = i;
    for(int u, v, w, i = 1; i <= m; i++){
        u = readint();
        v = readint();
        w = readint();
        e[i] = Edge(u, v, w);
    }
    sort(e + 1, e + m + 1);
    int ans;
    for(int k = 0, i = 1; i <= m && k < n - 1; i++){
        if(Find(e[i].u) == Find(e[i].v)) continue;
        fa[Find(e[i].u)] = Find(e[i].v);
        k++;
        ans = i;
    }
    printf("%d\n", e[ans].w);
    return 0;
}