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 there exists 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,接着是一个n*n的矩阵,比如位置i,j,存进去的就表示i到j的距离;然后再输入m,接着是m行,输入的;两个数表示两个位置已经连同,即距离为0;让你计算出全部连通的最短距离。
分析:没什么拐弯的,就是简单的最小生成树的问题,在模板上的输入稍加调整就行。
#include<stdio.h>
int m,n,sum,e[110][110],dis[110],book[110];
int inf = 99999999;
void Prim()
{
int i,j,k,min;
for(i = 1; i <= n; i ++)
{
dis[i] = e[1][i];
book[i] = 0;
}
dis[1] = 0;
book[1] = 1;
for(i = 1; i < n; i ++)
{
min = inf;
for(j = 1; j <= n; j ++)
if(book[j] == 0 && dis[j] < min)
{
min = dis[j];
k = j;
}
sum += min;
book[k] = 1;
for(j = 1; j <= n; j ++)
if(book[j] == 0 && dis[j] > e[k][j])
dis[j] = e[k][j];
}
}
int main()
{
int i,j,t1,t2;
while(scanf("%d",&n) != EOF)
{
sum = 0;
for(i = 1; i <= n; i ++)
for(j = 1; j <= n; j ++)
if(i == j)
e[i][j] = 0;
else
e[i][j] = inf;
for(i = 1; i <= n; i ++)
for(j = 1; j <= n; j ++)
scanf("%d",&e[i][j]);
scanf("%d",&m);
for(i = 1; i <= m; i ++)
{
scanf("%d%d",&t1,&t2);
e[t1][t2] = e[t2][t1] = 0;
}
Prim();
printf("%d\n",sum);
}
return 0;
}