B
来源:互联网 发布:网店大师软件 编辑:程序博客网 时间:2024/04/30 10:28
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.
* 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.
* Line 1: A single integer that is the length of the longest road required to be traversed.
3 31 2 232 3 10001 3 43
43题意,找到所有村庄中一条最长的路,用Kruskal算法,求最小生成树,刚开始的时候要把权值从小到大排序即可,然后求最大的一个权值,就是题中所要求的。
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;struct note{ int u; int v; int w;} q[10010];int f[2010];int cmp(note a,note b){ return a.w<b.w;}int find(int v){ if(f[v]==v)return v; else return find(f[v]);}int merge(int x,int y){ int t1,t2; t1=find(x); t2=find(y); if(t1!=t2) { f[t2]=t1; return 1; } return 0;}int main(){ int i,k,n,m; while(~scanf("%d%d",&n,&m)) { for(i=0; i<m; i++) scanf("%d%d%d",&q[i].u,&q[i].v,&q[i].w); sort(q,q+m,cmp); //按照权值从小到大排序 for(i=1; i<=n; i++) f[i]=i; int count=0; for(i=0; i<m; i++) { if(merge(q[i].u,q[i].v))//并查集看是否被连通 { count++; if(count==n-1) { k=i; //最长的一条路的下标 break; } } } printf("%d\n",q[k].w); }}
阅读全文
0 0
- b
- b
- b
- //b
- B
- b
- B
- B
- B
- B
- b
- B
- B
- B
- B
- B
- B
- b
- 泛型边界
- springmvc与mybatis的整合
- iOS app设备日志查看
- SSM+maven框架搭建好以后出现了406错误解决办法之一
- Java NIO系列教程(五) 通道之间的数据传输
- B
- 简单迭代服务器
- ping延迟小 但是有丢包 怎么解释
- POJ-1426 Find The Multiple(深搜)
- 递归算法【一些个人理解】
- 微信小程序之scroll-view
- 图像基础、OpenCV入门3——图像灰度化、二值化与图像加噪
- Dhtmlx
- CAD版本转换器(Acme CAD Converter 2017) v8.8.6中文版