hdu 1102 Constructing Roads(Prim)
2016-01-13 11:00
274 查看
Font Size: ← →
Problem Description
There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if there is a road between A and B, or thereexists a village C such that there is a road between A and C, and C and B are connected.
We know that there are already some roads between some villages and your job is the build some roads such that all the villages are connect and the length of all the roads built is minimum.
Input
The first line is an integer N (3 <= N <= 100), which is the number of villages. Then come N lines, the i-th of which contains N integers, and the j-th of these N integers is the distance (the distance should be an integer within [1, 1000])between village i and village j.
Then there is an integer Q (0 <= Q <= N * (N + 1) / 2). Then come Q lines, each line contains two integers a and b (1 <= a < b <= N), which means the road between village a and village b has been built.
Output
You should output a line contains an integer, which is the length of all the roads to be built such that all the villages are connected, and this value is minimum.Sample Input
3 0 990 692 990 0 179 692 179 0 1 1 2
Sample Output
179
题意: 已知n个村庄之间的距离,和已经建好的道路(已建好的路连接两个村庄,这两个村庄之间不需要再考虑距离),求能连接所有村庄的长度最短的路。
题解:最小生成树问题
#include <iostream> #include <memory.h> #define NUM 105 #define INF 0x3f3f3f3f using namespace std; int lowcost[NUM]; int n; int g[NUM][NUM]; bool vis[NUM]; int Prim() { int ans=0; memset(vis,false,sizeof(vis)); memset(lowcost,INF,sizeof(lowcost)); for(int i=1;i<=n;i++) lowcost[i]=g[1][i]; vis[1]=true; lowcost[1]=0; for(int i=2;i<=n;i++) { int Min=INF; int k=-1; for(int j=1;j<=n;j++) { if(!vis[j]&&lowcost[j]<Min) { Min=lowcost[j]; k=j; } } if(Min==INF) return -1; ans+=Min; vis[k]=true; for(int j=1;j<=n;j++) { if(!vis[j]&&lowcost[j]>g[k][j]&&g[k][j]!=INF) { lowcost[j]=g[k][j]; } } } return ans; } int main() { int m,a,b; while(cin>>n) { for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { cin>>g[i][j]; } } cin>>m; for(int i=0;i<m;i++) { cin>>a>>b; g[a][b]=g[b][a]=0; //注意道路是双向的 } int ans=Prim(); cout<<ans<<endl; } }
相关文章推荐
- apache 301跳转
- spring容器加载完后事件处理(利用ContextRefreshedEvent事件)
- SCNetworkReachability 说明使用
- 常用资源地址
- JAVA 身份证号码有效性验证
- List集合
- SemaPhore
- Swift入门
- 不错的博客和工具网站
- 动态规划算法的应用模型
- 开源框架
- log4j向多个文件记录日志
- 抽象类没有抽象方法
- 解决 iOS ViewController Push或者Pop 时的黑影
- 解决集成支付宝报一堆warning: (arm64) /Users/scmbuild/workspace/standard-pay/.....警告问题
- 当ListView中嵌套ViewPager滑动冲突问题
- Nginx配置防盗链
- Etcd配置集群但不起作用的解决办法
- UiAutomator——Android自动化测试工具简要介绍
- 列举游戏开发过程中的一些不良现象