最小生成树 prime算法 求权值最大的边
2014-08-06 16:48
232 查看
Out of HayDescriptionThe 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 allof 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, sheplans 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 backtrackover 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 43Sample Output
43
算法思想:最小生成树 prime算法 求最大权值的边
代码:
#include <iostream>#include<stdio.h>#include<algorithm>#include<string.h>#include<math.h>using namespace std;const int maxn=1000000009;int map[2010][2010];int visited[2010];int lowst[2010];int n,m;int prim(){int pos,minn,res=-1;memset(visited,0,sizeof(visited));visited[1]=1;pos=1;for(int i=1;i<=n;i++){if(pos!=i) lowst[i]=map[pos][i];}for(int i=1;i<n;i++){minn=maxn;for(int j=1;j<=n;j++){if(!visited[j]&&minn>lowst[j]){minn=lowst[j];pos=j;}}if(res<minn) res=minn;visited[pos]=1;for(int j=1;j<=n;j++){if(!visited[j]&&lowst[j]>map[pos][j])lowst[j]=map[pos][j];}}return res;}int main(){scanf("%d%d",&n,&m);for(int i=1;i<=n;i++){for(int j=1;j<=n;j++)map[i][j]=maxn;}for(int i=0;i<m;i++){int a,b,c;scanf("%d%d%d",&a,&b,&c);if(map[a][b]>c)map[a][b]=map[b][a]=c;}printf("%d\n",prim());return 0;}
相关文章推荐
- POJ 2485 Highways(最小生成树,树的最大权值边)
- 并查集+排序 的最长木材问题 求最小生成树的最大边权值问题
- poj 2485 Highways(最小生成树中求最大权值)
- Prim最小生成树(求,生成树中权值的和,最大权值,最小权值) 参考poj1258 2485
- (prim算法题型一)求最小生成树的权值和、路径、边值的最小和最大值。
- (hruscal12.3.3)POJ 3522 Slim Span(求解一个生成树使得该树中的最大边权值和最小边权值之差最小)
- poj 2377 最大生成树 最小生成树的变形
- 【解题报告】 HDU 1102 Constructing Roads -- 并查集 最小生成树 Prime算法
- POJ2485 求最小生成树的最大边 (裸prim)
- POJ2395 最小生成树 - Prime算法
- 51nod 1640最小生成树&最大生成树
- [BZOJ1937][SHOI2004]Mst最小生成树(KM算法,最大费用流)
- POJ 2485 Highways 最小生成树的最大边
- BZOJ_P2561 最小生成树(网络流+最大流ISAP)
- poj3532求生成树中最大权与最小权只差最小的生成树+hoj1598俩个点之间的最大权与最小权只差最小的路经。
- 最小生成树 Prime算法
- 图论;克鲁斯卡尔算法;最小生成树;通过权值排序可以优化时间效率;
- poj2485 Highways 最小生成树求最大边
- (kruscal12.3.5)POJ 2485 Highways(使用kruscal来计算最小生成树的最大边)
- 通过随机数生成办法,向int num[10][10]的数组 中存入数据并找出数组的最大、最小值及其下标。