Out of Hay
来源:互联网 发布:网络课程女子礼仪答案 编辑:程序博客网 时间:2024/05/29 08:35
E - Out of HayTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluDescription
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 31 2 232 3 10001 3 43Sample Output
43Hint
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<stdio.h>#include<algorithm>using namespace std;struct node{int u;int v;int w;}e[10010];int f[10010];bool cmp(node a,node b){return a.w<b.w;}int getf(int x){if(x==f[x])return x;f[x]=getf(f[x]);return f[x];}int merge(int y1,int y2){int b1,b2;b1=getf(y1);b2=getf(y2);if(b1!=b2){f[b1]=b2;return 1;}return 0;}int main(){int n,m,num=0,ans=0;scanf("%d %d",&n,&m);int i,j,k,t=0;k=m;while(k--){scanf("%d %d %d",&e[t].u,&e[t].v,&e[t].w);t++;}sort(e,e+m,cmp);for(i=1;i<=n;i++)f[i]=i;for(j=0;j<m;j++){if(merge(e[j].u,e[j].v)){if(ans<e[j].w)ans=e[j].w;num++;}if(num==n-1){break;}}printf("%d",ans);return 0; }
0 0
- POJ2395--Out of Hay
- POJ2395---Out of Hay
- POJ2395--Out of Hay
- Out of Hay
- Out of Hay
- POJ2395-Out of Hay
- USACO Out of Hay
- Out of Hay
- Out of Hay
- POJ2395 Out of Hay
- POJ2395 Out of Hay
- Out of Hay HDU
- Out of Hay POJ
- Out of Hay
- Out of Hay
- POJ Out of Hay
- Out of Hay
- Out of Hay
- Bad Cowtractors
- 在线代码编辑器 CODEMIRROR 配置说明
- 模仿小米手环 计步数据的展示View
- fir.im Weekly - 暖心的 iOS 持续集成,你值得拥有
- Ajax基本概念以及JS实现Ajax的过程
- Out of Hay
- 线性表1-顺序表
- 网络安全-常见漏洞与分析
- 正视自己的问题
- linux时间同步
- LINUX : 红帽软件包管理器,YUM仓库
- 机器学习笔记二:线性回归与最小二乘法
- CSS3属性transition(过渡)详解
- 关于merge函数的使用