POJ 2395 Out of Hay
来源:互联网 发布:codol淘宝刷gp原理 编辑:程序博客网 时间:2024/05/15 21:43
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<algorithm>#include<iostream>#include<cstdio>using namespace std;int n,m,ans,f[2005];struct node{ int x,y,val;}a[10005];bool cmp(node c,node d){ return c.val<d.val;}int fnd(int x){ if(f[x]!=x) f[x]=fnd(f[x]); return f[x];}int main(){ scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) f[i]=i; for(int i=1;i<=m;i++) scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].val); sort(a+1,a+m+1,cmp); for(int i=1;i<=m;i++) if(fnd(a[i].x)!=fnd(a[i].y)) { f[fnd(a[i].x)]=fnd(a[i].y); ans=max(ans,a[i].val); } printf("%d\n",ans); return 0;}
- poj 2395 Out of Hay
- poj 2395 Out of Hay
- poj 2395 Out of Hay
- poj 2395 Out of Hay
- poj -2395-Out of Hay
- POJ-2395-Out of Hay
- POJ 2395 Out of Hay
- POJ 2395 Out of Hay
- POJ 2395 Out of Hay
- 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
- POJ 2395 Out of Hay
- poj 2395 Out of Hay
- POJ 2395 Out of Hay
- poj-2395 Out of Hay
- elasticsearch资源汇总
- ccf 消除类游戏
- Android快速开发与体系搭建--代码管理--Gitlab
- BROADBAND POWERLINE COMMUNICATIONS NETWORK DESIGN:宽带电力线通信网络设计
- Win 10 下安装Win 7双系统
- POJ 2395 Out of Hay
- Java中实现多线程顺序执行
- Java反射机制
- osgearth各个例子功能概述
- JAVA基础day06 static关键字 静态方法的运用 java程序文档的制作
- 利用工具将数据库中的表导出到word中
- INT5500 datasheet
- Ubuntu安装完成后遇到的几个问题
- jquery3.0源码解读(二)Extend