【最小生成树】POJ 2395 Out of Hay
来源:互联网 发布:imdb评分靠谱吗 知乎 编辑:程序博客网 时间:2024/05/20 05:30
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
OUTPUT DETAILS:
In order to reach farm 2, Bessie travels along a road of length 23. To reach farm 3, Bessie travels along a road of length 43. With capacity 43, she can travel along these roads provided that she refills her tank to maximum capacity before she starts down a road.
最小生成树裸题:
#include<iostream>#include<cstdio>#include<algorithm>using namespace std;const int MAXM=10000+10,MAXN=2000+10;int fa[MAXN];struct node{ int x; int y; int z;};node a[MAXM];int comp(const node&i,const node&j){ return i.z<j.z;}int found(int x){ if(fa[x]!=x)fa[x]=found(fa[x]); return fa[x];}int main(){ int n,m; scanf("%d%d",&n,&m); for(int i=1;i<=n;i++)fa[i]=i; for(int i=1;i<=m;i++)scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].z); sort(a+1,a+m+1,comp); int maxs=-1,k=0; for(int i=1;i<=m;i++) { if(found(a[i].x)!=found(a[i].y)) { fa[found(a[i].x)]=found(a[i].y); k++; maxs=max(maxs,a[i].z); } } cout<<maxs; return 0;}
- POJ - 2395 Out of Hay (最小生成树, Kruskal)
- Poj 2395 Out of Hay( 最小生成树 )
- POJ 2395 Out of Hay(最小瓶颈生成树)
- POJ 2395 - Out of Hay(最小生成树)
- POJ Out of Hay(2395 prim最小生成树)
- Out of Hay (poj 2395 最小生成树)
- poj 2395 Out of Hay(最小生成树)
- POJ 2395 Out of Hay 最小生成树
- POJ 2395 Out of Hay【最小生成树】
- POJ 2395 Out of Hay (Kruscal最小生成树)
- poj 2395 Out of Hay 求最小生成树
- 【最小生成树】POJ 2395 Out of Hay
- POJ 2395 Out of Hay 最小生成树 Kruskal
- poj 2395 Out of Hay (最小生成树)
- POJ 2395 Out of Hay(最小生成树)
- poj Out of hay 最小生成树 kruscal
- POJ2395 Out of Hay 最小生成树
- POJ2395 Out of Hay 最小生成树
- Android中proguard混淆第三方jar包
- C#语法和深入string类
- 贪心算法--寻找最大数(一)
- java-多线程-基本概念/四种种创建thread的方式
- custom font设置打样
- 【最小生成树】POJ 2395 Out of Hay
- 什么情况下用+运算符进行字符串连接比调用StringBuffer/StringBuilder对象的append方法连接字符串性能更好?
- 哈希加密算法 MD5,SHA-1,SHA-2,SHA-256,SHA-512,SHA-3,RIPEMD-160
- android--利用SlidingPaneLayout实现简单的侧滑功能
- 2017 自考近代史 最后两道大题
- 综合使用spring cloud技术实现微服务应用
- html之marquee详解
- k-means算法及文本聚类实践
- Android设计模式-Builder模式