POJ Out of Hay(2395 prim最小生成树)
来源:互联网 发布:js获取系统当前日期 编辑:程序博客网 时间:2024/06/02 21:18
Out of Hay
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11814 Accepted: 4628
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
#include<iostream>#include<cstring>#include<cstdio>using namespace std;const int maxn = 2001;int m,n;int map[maxn][maxn];bool vis[maxn];int dis[maxn];#define inf 0x7fffffffint prim(){ int i,j; int ans; memset(vis,0,sizeof(vis)); for(i=1; i<=m; i++) { dis[i] = inf; } ans = 0; dis[1] = 0; for(i=1; i<=m; i++) { int tmp = inf,k = 0; for(j=1; j<=m; j++) { if(!vis[j] && dis[j] < tmp) { tmp = dis[j]; k = j; } } if(tmp == inf) return 0; vis[k] = true; if(tmp > ans) { ans = tmp; } for(j=1; j<=m; j++) //更新新的权值,从k到j如果小于直接到j,那么就更新 { if(!vis[j] && dis[j] > map[k][j]) { dis[j] = map[k][j]; } } } return ans;}int main(){ int i; int pos1,pos2,num1; freopen("111","r",stdin); while(cin>>m>>n) { memset(map,100,sizeof(map)); memset(dis,0,sizeof(dis)); for(i=1; i<=n; i++) { cin>>pos1>>pos2>>num1; if(map[pos1][pos2] > num1) map[pos1][pos2] = map[pos2][pos1] = num1; //cout<<map[pos1][pos2]<<endl; } cout<<prim()<<endl; } return 0;}
0 0
- POJ Out of Hay(2395 prim最小生成树)
- POJ 2395 Out of Hay(最小生成树—prim算法记录最大边)
- POJ - 2395 Out of Hay (最小生成树, Kruskal)
- Poj 2395 Out of Hay( 最小生成树 )
- POJ 2395 Out of Hay(最小瓶颈生成树)
- POJ 2395 - Out of Hay(最小生成树)
- Out of Hay (poj 2395 最小生成树)
- poj 2395 Out of Hay(最小生成树)
- POJ 2395 Out of Hay 最小生成树
- POJ 2395 Out of Hay【最小生成树】
- POJ 2395 Out of Hay (Kruscal最小生成树)
- poj 2395 Out of Hay 求最小生成树
- 【最小生成树】POJ 2395 Out of Hay
- POJ 2395 Out of Hay 最小生成树 Kruskal
- poj 2395 Out of Hay (最小生成树)
- POJ 2395 Out of Hay(最小生成树)
- poj Out of hay 最小生成树 kruscal
- POJ2395 Out of Hay 最小生成树
- 【黑马程序员】Objetive-C 对象详解 一
- 编程之美:中国象棋将帅问题(开篇)
- 出现 encountered * errors during the transfer 错误
- tesseract在ok6410下的实现(一)
- CAS单点登录源码解析之【客户端】
- POJ Out of Hay(2395 prim最小生成树)
- Java中获取当前时间的类
- Android消息队列模型——Thread,Handler,Looper,Massage Queue
- ios多线程操作(三)—— 线程通讯
- 实心菱形
- ascii排序2, 测试通过
- linux下maven的安装
- 题目:如何判断一个机器是大端还是小端
- [译]【Storm入门指南】第六章 真实示例