POJ:2395-Out of Hay
Out of Hay
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 18780 Accepted: 7414
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.
Samle 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.
解题心得:
- 题意就是有n个农场,m条边,要选总长度最小的边将n个农场都连接起来,并且要求最长的边最小,其实很简单啊,直接用Kruskal跑最小生成树,最后一定是满足总长度最小最大的边最小的。
#include <stdio.h>
#include <algorithm>
#include <cstring>
using namespace std;
const int maxn = 1e4+100;
struct Path{
int s,e,len;
bool operator < (const Path &a) const {
return a.len > len;
}
}path[maxn];
int n,m,father[maxn];
void init() {
for(int i=1;i<=n;i++)
father[i] = i;
for(int i=0;i<m;i++)
scanf("%d%d%d",&path[i].s,&path[i].e,&path[i].len);
sort(path,path+m);
}
int find(int x) {
if(father[x] == x)
return x;
return father[x] = find(father[x]);
}
void merge(int x,int y) {
int fx = find(x);
int fy = find(y);
father[fx] = fy;
}
int main() {
scanf("%d%d",&n,&m);
init();
int Max = -1;
for(int i=0;i<m;i++) {
if(find(path[i].e) != find(path[i].s)) {
merge(path[i].s , path[i].e);
Max = path[i].len;
}
}
printf("%d",Max);
return 0;
}
最新文章
- 配置eclipse J2EE环境
- C# oracle odp.net 32位/64位版本的问题
- Android 资源(resource详解(转)
- ae动态显示属性表————切记DataTable中要先Add(row)之后再往里传值。
- CentOS下vsftp安装、配置、卸载(转载)
- ecshop 后台【左侧新增菜单】
- NYOJ题目65另一种阶乘问题
- [整理][LaTex]小技巧之——首行缩进
- SSDT Hook实现简单的进程隐藏和保护【转载】
- Trie的C++实现及HDU1251,hdu1671
- Uva_11762 Race to 1
- 如何处理JS与smarty标签的冲突
- SQL Server 内存压力解决方案
- Android 启动Activity的方式
- ACE编译
- Sprintf()的思考和引出的相关问题
- Ubantu16.04系统优化
- (转)MFC界面风格
- luogu P1084 疫情控制
- 分布式系统缓存系列之guava cache