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
本题是最小生成树模板题, 只不过多了已连通的几个点,只要将连通的点存入map数组的时候值为零即可。
#include<stdio.h>
int main()
{
int map[110][110];//map数组储存两点之间的距离
int dis[110], book[110] = { 0 };
int n, i, j, k, x, y, t, count = 1, sum = 0;
int u;
scanf("%d", &n);
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
scanf("%d", &map[i][j]);
scanf("%d", &t);
for (i = 1; i <= t; i++)
{
scanf("%d%d", &x, &y);//让已建好的两点间的距离为零
map[x][y] = 0;
map[y][x] = 0;
}
for (i = 1; i <= n; i++)
dis[i] = map[1][i];
book[1] = 1;
while (count < n)
{
int min = 999999;
for (i = 1; i <= n; i++)
{
if (book[i] == 0 && dis[i] < min)
{
min = dis[i];
u = i;
}
}
book[u] = 1, count++, sum += dis[u];
for (k = 1; k <= n; k++)
{
if (book[k] == 0 && dis[k] > map[u][k])
dis[k] = map[u][k];
}
}
printf("%d", sum);
return 0;
}