Out of Hay
来源:互联网 发布:梦幻诛仙手游软件礼包 编辑:程序博客网 时间:2024/05/23 00:00
Out of Hay
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18074 Accepted: 7137
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.
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.
* 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 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.
最小生成树记录一下最大边即可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 list{int u;int v;int w;}an[10005];;int pre[2005];bool cmp(struct list a,struct list b){return a.w<b.w;}int find(int x){return x==pre[x]?x:pre[x]=find(pre[x]);}int kruskal(struct list an[],int m,int n){int sum=0,cnt=0;for(int i=0;i<=n;i++)pre[i]=i;sort(an,an+m,cmp);for(int i=0;i<m;i++){int fu,fv;fu=find(an[i].u);fv=find(an[i].v);if(fu!=fv){pre[fu]=fv;sum=max(sum,an[i].w);if(++cnt==n-1)return sum;}}}int main(){int n,m;scanf("%d%d",&n,&m);for(int i=0;i<m;i++){scanf("%d%d%d",&an[i].u,&an[i].v,&an[i].w);}printf("%d\n",kruskal(an,m,n));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
- 名片识别SDK
- bootstrapTable 动态表头生成
- java基础——final
- 在Mac上安装office2016破解版
- [转] MyEclipse 快捷键
- Out of Hay
- B树C语言实现-创建、插入、删除
- 导出函数__declspec(dllexport)
- 用Servlet获取表单数据
- 生成32位,16进制的UUID
- IOS开发类之间的继承关系 两张树状图片
- 4.4分支管理策略
- mysql用update方法更改用户密码
- 算法:(贪心算法)-独木舟问题