# BZOJ_P1682 [Usaco2005 Mar]Out of Hay 干草危机(最小生成树)

BZOJ传送门

Time Limit: 5 Sec Memory Limit: 64 MB
Submit: 487 Solved: 329
[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.

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

HINT

Source
Silver

Sol:

#include<cstdio>
#include<algorithm>
using namespace std;
#define N 2005
#define M 10005
inline int in(int x=0,char ch=getchar()){while(ch>'9'||ch<'0') ch=getchar();
while(ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+ch-'0',ch=getchar();return x;}
int n,m,cnt,ans;struct Edge{int u,v,d;}edge[M];int f[N];
int cmp(Edge a,Edge b){return a.d<b.d;}
int find(int x){return x==f[x]?x:f[x]=find(f[x]);}
int main(){
n=in(),m=in();int u,v,d,f1,f2;
for(int i=1;i<=m;i++) u=in(),v=in(),d=in(),edge[++cnt]=(Edge){u,v,d};
sort(edge+1,edge+m+1,cmp);for(int i=1;i<=n;i++) f[i]=i;
for(int i=1;i<=m;i++){
u=edge[i].u,v=edge[i].v;
f1=find(u),f2=find(v);
if(f1!=f2) f[f2]=f1,ans=max(ans,edge[i].d);
}
printf("%d\n",ans);
return 0;
}
• 1
点赞
• 0
评论
• 0
收藏
• 一键三连
• 扫一扫，分享海报

09-30 17
09-28 264
05-27 29
11-29 2113
07-29 236
01-27 3750
01-31 408
06-10 59
03-24 98

BeiYu-oi

¥2 ¥4 ¥6 ¥10 ¥20