Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course.
Farmer John ordered a high speed connection for his farm and is going to share his connectivity with the other farmers. To minimize cost, he wants to lay the minimum amount of optical fiber to connect his farm to all the other farms.
Given a list of how much fiber it takes to connect each pair of farms, you must find the minimum amount of fiber needed to connect them all together. Each farm must connect to some other farm such that a packet can flow from any one farm to any other farm.
The distance between any two farms will not exceed 100,000.
Input
The input includes several cases. For each case, the first line contains the number of farms, N (3 <= N <= 100). The following lines contain the N x N conectivity matrix, where each element shows the distance from on farm to another. Logically, they are N lines of N space-separated integers. Physically, they are limited in length to 80 characters, so some lines continue onto others. Of course, the diagonal will be 0, since the distance from farm i to itself is not interesting for this problem.
Output
For each case, output a single integer length that is the sum of the minimum length of fiber required to connect the entire set of farms.
Sample Input
4
0 4 9 21
4 0 8 17
9 8 0 16
21 17 16 0
Sample Output
28
思路
这道题用到了最小生成树的思想。从第一个点开始,每次都连接距离最小的点,然后连接后的点就看成一个整体。
#include <iostream>
#include <stdio.h>
#include <cstring>
using namespace std;
int n,sum,minn;
int a[105][105],book[105],dis[105];
int inf=999999999;
void prim()//已经连接的点看成一个整体
{
int k;
sum=0;
for(int i=0;i<=n;i++)
{//重置book数组
book[i]=0;//book用来标记已经连接的点
dis[i]=a[1][i];//用来记录已经连接的点中,到未连接的点的最短的距离
}
dis[1]=0;
book[1]=1;
for(int i=1;i<n;i++)
{
minn=inf;
for(int j=1;j<=n;j++)
{
if(book[j]==0&&dis[j]<minn)
{
minn=dis[j];
k=j;
}
}
sum=sum+minn;
book[k]=1;
for(int j=1;j<=n;j++)
{
if(book[j]==0&&dis[j]>a[k][j])
{
dis[j]=a[k][j];
}
}
}
}
int main()
{
while(scanf("%d",&n)!=EOF)
{
sum=0;
memset(a,0,sizeof(a));
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
scanf("%d",&a[i][j]);
}
}
prim();
printf("%d\n",sum);
}
return 0;
}