Jungle Roads 最小生成树
来源:互联网 发布:图像自动拼接软件 编辑:程序博客网 时间:2024/05/01 01:57
The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overtakes roads relentlessly, so the large road network is too expensive to maintain. The Council of Elders must choose to stop maintaining some roads. The map above on the left shows all the roads in use now and the cost in aacms per month to maintain them. Of course there needs to be some way to get between all the villages on maintained roads, even if the route is not as short as before. The Chief Elder would like to tell the Council of Elders what would be the smallest amount they could spend in aacms per month to maintain roads that would connect all the villages. The villages are labeled A through I in the maps above. The map on the right shows the roads that could be maintained most cheaply, for 216 aacms per month. Your task is to write a program that will solve such problems.
Input
The input consists of one to 100 data sets, followed by a final line containing only 0. Each data set starts with a line containing only a number n, which is the number of villages, 1 < n < 27, and the villages are labeled with the first n letters of the alphabet, capitalized. Each data set is completed with n-1 lines that start with village labels in alphabetical order. There is no line for the last village. Each line for a village starts with the village label followed by a number, k, of roads from this village to villages with labels later in the alphabet. If k is greater than 0, the line continues with data for each of the k roads. The data for each road is the village label for the other end of the road followed by the monthly maintenance cost in aacms for the road. Maintenance costs will be positive integers less than 100. All data fields in the row are separated by single blanks. The road network will always allow travel between all the villages. The network will never have more than 75 roads. No village will have more than 15 roads going to other villages (before or after in the alphabet). In the sample input below, the first data set goes with the map above.
Output
The output is one integer per line for each data set: the minimum cost in aacms per month to maintain a road system that connect all the villages. Caution: A brute force solution that examines every possible set of roads will not finish within the one minute time limit.
Sample Input
9
A 2 B 12 I 25
B 3 C 10 H 40 I 8
C 2 D 18 G 55
D 1 E 44
E 2 F 60 G 38
F 0
G 1 H 35
H 1 I 35
3
A 2 B 10 C 40
B 1 C 20
0
Sample Output
216
30
prim算法
#include<cstdio>#include<cstring>#define INF 0x3f3f3f3fint mapp[110][110];bool v[110];int d[110];int prim(int n){ memset(d,0x3f,sizeof(d)); memset(v,false,sizeof(v)); int pt,res = 0,min; pt = 1,v[1] = true; while (true){ for (int i = 1; i <= n; ++i){ if (!v[i] && d[i] > mapp[pt][i]) //没走过的点 所在范围的点 距离大于该点 更新该点到pt的距离 d[i] = mapp[pt][i]; } pt = -1,min = INF; for (int i = 1; i <= n; ++i){ if (!v[i] && min > d[i]){ min = d[i];//没走过的点 且该点已更新 整体找到最短的路 记该点为pt下次从这个点开始更新 大概就是每次更新完边就在所有更新的边中找最小值连边 有点kruskal的感觉 不过连的边都限制于刚刚更新过的点 时间复杂度为o(n*n) n为点的个数 pt = i; } } if (pt == -1) break; v[pt] = true; res += min; } return res;}int main(){ int t; while (scanf("%d",&t),t){ for (int i = 0; i <= t; ++i){ for (int j = 0; j <= t; ++j){ mapp[i][j] = mapp[j][i] = INF; } } char sr[5],sf[5]; int dr; for (int i = 0; i < t-1; ++i){ scanf("%s %d",sr,&dr); int dd; for (int i = 0; i < dr; ++i){ scanf("%s%d",sf,&dd); if (mapp[sr[0]-'A'+1][sf[0]-'A'+1] > dd){ mapp[sr[0]-'A'+1][sf[0]-'A'+1] = dd; mapp[sf[0]-'A'+1][sr[0]-'A'+1] = dd; } } } printf("%d\n",prim(t)); } return 0;}
注意用%c会吸收空格
- Jungle Roads(最小生成树)
- Jungle Roads 最小生成树
- ZOJ 1406 Jungle Roads (最小生成树)
- zoj 1406 Jungle Roads 最小生成树
- zoj1406----------Jungle Roads 最小生成树 prim
- POJ 1251 Jungle Roads 最小生成树
- ZOJ 1406 Jungle Roads (最小生成树)
- HDU 1301 Jungle Roads 最小生成树
- poj 1251 Jungle Roads ---最小生成树
- Poj 1251 Jungle Roads -- 最小生成树
- 最小生成树 Jungle Roads
- 题目1154:Jungle Roads:最小生成树
- poj 1251 Jungle Roads 最小生成树
- POJ 1251 Jungle Roads(最小生成树)
- poj 1251 Jungle Roads 最小生成树
- Jungle Roads(最小生成树)
- Jungle Roads - POJ 1251 最小生成树
- HDU1301 Jungle Roads 【最小生成树Prim】
- linux安装多tomcat的配置方法(常见问题:Cannot find //bin/setclasspath.sh)
- hibernate deleteAll问题
- NumPy详细API第二篇
- 计算机程序设计艺术一欧几里得算法
- java批量修改文件名
- Jungle Roads 最小生成树
- python 笔记4
- Java反射机制详解(转载)
- 各邮箱smtp服务器及支持的协议
- 组内菜鸟学习班
- [CRT][中国剩余定理]CRT小结
- 【面试题】剑指offer20
- 翻译:如何使用CSS实现多行文本的省略号显示
- python中list,tuple,dict,set的区别及联系