Out of Hay(最小生成树的最大权)
来源:互联网 发布:中级经济师题库软件 编辑:程序博客网 时间:2024/06/08 14:05
原题链接
Out of Hay
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 15516 Accepted: 6056
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.
OutputLine 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
//http://poj.org/problem?id=2395#include <algorithm>#include <iostream>#include <utility>#include <sstream>#include <cstring>#include <cstdio>#include <vector>#include <queue>#include <stack>#include <cmath>#include <map>#include <set>using namespace std;typedef long long ll;const int MOD = int(1e9) + 7;//int MOD = 99990001;const int INF = 0x3f3f3f3f;const ll INFF = (~(0ULL)>>1);const double EPS = 1e-9;const double OO = 1e20;const double PI = acos(-1.0); //M_PI;const int fx[] = {-1, 1, 0, 0};const int fy[] = {0, 0, -1, 1};const int maxn=10000 + 5;struct edge{int x,y,val;}E[maxn];int n,r;int fa[maxn],deep[maxn];priority_queue<int> que;bool cmp(edge a,edge b){ return a.val<b.val;}int findfa(int x){ return x==fa[x] ? x : fa[x]=findfa(fa[x]);}void unite(int a,int b){ int faa=findfa(a); int fab=findfa(b); if(faa==fab) return; else{ if(deep[faa]<deep[fab]){ fa[faa]=fab; } else if(deep[faa]>deep[fab]){ fa[fab]=faa; } else{ fa[fab]=faa; deep[faa]++; } }}void kruskal(){ sort(E,E+r,cmp); for(int i=0;i<=n;i++){ fa[i]=i; deep[i]=0; } for(int i=0;i<r;i++){ if(findfa(E[i].x) != findfa(E[i].y)){ unite(E[i].x,E[i].y); que.push(E[i].val); } } return;}int main(){ cin >> n >> r; for(int i=0;i<r;i++){ scanf("%d%d%d",&E[i].x,&E[i].y,&E[i].val); } kruskal(); cout << que.top() << endl; return 0;}
- Out of Hay(最小生成树的最大权)
- POJ2395 Out of Hay 最小生成树
- POJ2395 Out of Hay 最小生成树
- POJ2395 Out of Hay(最小生成树)
- poj2395 Out of Hay(最小生成树)
- POJ - 2395 Out of Hay (最小生成树, Kruskal)
- POJ 2395 Out of Hay (Kruscal最小生成树)
- 2395:Out of Hay(最小生成树)
- poj 2395 Out of Hay、2485 Highways(求最小生成树的最长边)
- poj 2395 Out of Hay (最小生成树的最大边)
- poj Out of hay 最小生成树 kruscal
- Poj 2395 Out of Hay( 最小生成树 )
- poj2395--Out of Hay(最小生成树)
- POJ 2395 Out of Hay(最小瓶颈生成树)
- POJ 2395 - Out of Hay(最小生成树)
- POJ Out of Hay(2395 prim最小生成树)
- Out of Hay (poj 2395 最小生成树)
- 北大ACM2395——Out of Hay~~最小生成树
- DbVisualizer配置连接hive
- 51Nod-1412-AVL树的种类
- Bad Cowtractors(最大生成树与判定)
- 78. Subsets &90. Subsets II
- CSS文本样式
- Out of Hay(最小生成树的最大权)
- HDU 5452-C - Minimum Cut 树链剖分
- Agri-Net(最小生成树)
- 大二入学感慨
- JAVA基础--LinkedHashSet 和 LinkedHashMap
- Wormholes(负圈)
- Java深入 - Java内存区域详解
- 操作系统概述
- Gym 100851AAdjustment Office 解题报告