HDU 1301 最小生成树
来源:互联网 发布:渠道网络可靠吗 编辑:程序博客网 时间:2024/05/17 05:04
Jungle Roads
Problem Description
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.
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.
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
9A 2 B 12 I 25B 3 C 10 H 40 I 8C 2 D 18 G 55D 1 E 44E 2 F 60 G 38F 0G 1 H 35H 1 I 353A 2 B 10 C 40B 1 C 200
Sample Output
21630
题目只要看懂意思就很简单了,比如A 2 B 12 I 25
就是说与A相关的有两个,A-B权值是5,A-I权值是25...soga...
#include <iostream> #include <algorithm>using namespace std;int vis[101];int lowcost[101];int map[101][101];int n;int Min,sum,pos;int prim(){int i,j;for(i=0;i<n;i++)lowcost[i]=map[0][i];vis[0]=1;sum=pos=0;for(i=1;i<n;i++){Min=100000;for(j=0;j<n;j++){if(Min>lowcost[j]&&!vis[j]){Min=lowcost[j];pos=j;}}sum+=Min;vis[pos]=1;for(j=0;j<n;j++){if(lowcost[j]>map[pos][j]&&!vis[j])lowcost[j]=map[pos][j];}}return sum;}int main(){int i,j;char c,c1;int num,xx;while(cin>>n,n){memset(vis,0,sizeof(vis));for(i=0;i<n;i++)for(j=0;j<n;j++)map[i][j]=1000;int t=n;while(--t){cin>>c>>num;while (num--){cin>>c1>>xx;map[c-'A'][c1-'A']=map[c1-'A'][c-'A']=xx;}}cout<<prim()<<endl;} return 0; }
- HDU 1301 最小生成树
- hdu 1301 最小生成树
- HDU(1301)最小生成树
- hdu 1301 最小生成树
- HDU 1301 Jungle Roads 最小生成树
- hdu 1301(最小生成树kruskal)
- POJ-1251 HDU-1301 (最小生成树)
- HDU-1301 Jungle Roads (最小生成树)
- 各种最小生成树。 HDU 1863 HDU 1301 POJ 1258
- HDU 1879 最小生成树
- HDU-1836 最小生成树
- hdu 1863 最小生成树
- hdu 1233 最小生成树
- hdu 4081 最小生成树
- hdu 1863 最小生成树
- HDU-1162(最小生成树)
- hdu 1233 最小生成树
- hdu 2682 最小生成树
- POJ 1679 判断最小生成树是否有多种情况
- 存储之硬盘
- 教你查看预装Win8电脑内置系统激活密钥(Win8 OEM Key)
- SecureCRT and cuteftp 安装与配置
- 一位艺术专业人士倔强的编程之路:未来180天构建180个网站
- HDU 1301 最小生成树
- 堆区中字符串压栈顺序
- ios地图开发之-Bing Maps地图基础教程
- HDU4614 Vases and Flowers
- 创建Windows服务程序实现定时操作
- apt-get 使用详解
- CvImage中的陷阱和BUG----CvImage(IplImage* img)陷阱
- MFC中CString转换成char数组的问题
- SYSZUXpinyin中文输入法的移植(到QT)