Out of Hay
来源:互联网 发布:电脑网络 编辑:程序博客网 时间:2024/05/15 00:33
Out of Hay
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 13094 Accepted: 5078
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.
Source
USACO 2005 March Silver
求最小生成树的最大边,Kruskal
#include <iostream>#include <cmath>#include <cstring>#include <cstdlib>#include <stdio.h>#include <string>#include <queue>#include <vector>#include <algorithm>#define LL long longusing namespace std;const int INF = 0x3f3f3f3f;const int MAX = 11000;int n,m;int pre[3000];typedef struct node{ int x; int y; int dis;}K;K Edge[MAX];void init(){ for(int i=1;i<=n;i++) { pre[i]=i; }}bool cmp(node a,node b){ return a.dis<b.dis;}int Find(int x){ return x==pre[x]?x:pre[x]=Find(pre[x]);}int Kruskal(){ int num=0,Max=0; for(int i=0;i<m;i++) { int a=Find(Edge[i].x); int b=Find(Edge[i].y); if(a!=b) { num++; pre[a]=b; if(Max<Edge[i].dis) { Max=Edge[i].dis; } } if(num==n-1) { break; } } return Max;}int main(){ while(~scanf("%d %d",&n,&m)) { init(); for(int i=0;i<m;i++) { scanf("%d %d %d",&Edge[i].x,&Edge[i].y,&Edge[i].dis); } sort(Edge,Edge+m,cmp); printf("%d\n",Kruskal()); } return 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
- poj 1458
- 九度 Online Judge 算法 刷题 题目1062:分段函数
- Gradle 发布公共模块到maven库(android版)
- IOS开发中rss解析数据解析
- java反照机制模拟按键输入
- Out of Hay
- new/delete和mallco/free的深入理解
- POJ 1181 大整数是否为素数以及求大整数的质因数-数论-(Miller_rabin+Pollard_rho)
- ZOJ 3537 Cake 凸包+区间DP+记忆化搜索
- 有return的情况下try catch finally的执行顺序(最有说服力的总结)
- IOS动画效果[转载]
- C++中删除vector容器中元素的三种方法及其区别
- 九度 Online Judge 算法 刷题 题目1063:整数和
- IOS开发中使用TFHpple解析html