POJ 2395 Out of Hay
2016-04-17 09:14
447 查看
Out of Hay
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.
Sample Input
Sample Output
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.
求最小生成树的最大边
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 14161 | Accepted: 5500 |
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.
Sample 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.
求最小生成树的最大边
#include <stdio.h> #include <string.h> int map[2005][2005]; int dist[2005]; bool vis[2005]; int N, M; int main() { int i, j, f, min, sum, A, B, L; while(scanf("%d%d", &N, &M) != EOF) { memset(map, 0x3f, sizeof(map)); for(i = 1; i <= M; i++) { scanf("%d%d%d", &A, &B, &L); if(L < map[A][B]) map[A][B] = map[B][A] = L; } memset(vis, false, sizeof(vis)); memset(dist, 0x3f, sizeof(dist)); dist[1] = 0; sum = 0; for(i = 1; i <= N; i++) { f = -1; min = 0x3f3f3f3f; for(j = 1; j <= N; j++) if(!vis[j] && dist[j] < min) min = dist[f = j]; if(f == -1) break; vis[f] = true; sum = sum > min ? sum : min; for(j = 1; j <= N; j++) if(!vis[j] && dist[j] > map[f][j]) dist[j] = map[f][j]; } printf("%d\n", sum); } return 0; }
相关文章推荐
- Makefile学习(1) arm-linux-ld arm-linux-objcopy arm-linux-objdump
- C++11编译器支持列表
- 自己实现的一个Cache 使用最近常使用算法
- 计算机网络中的TCP/UDP协议到底是怎么回事(一)
- 浅谈测试驱动开发(TDD)
- HDU 2102 A计划
- POJ 2488 A Knight's Journey
- POJ 3176 Cow Bowling
- POJ 1664 放苹果
- 从BlueSky.h和BlueSky.cpp到BlueSky.out的那些事儿
- C#单元测试面面观
- 《董福祥宫保府》后记
- SOAPUI笔记1: window安装
- POJ 3259 Wormholes
- Tech Blog
- 基于zookeeper应用——简单统一命名服务实现
- PHP垃圾回收机制
- 程序员必须要掌握的排序算法以及查找方法
- iOS之const,static,extern简介
- 项目内部IT/电商/信息化类简报,分享电子版