A - Agri-Net
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d
& %I64u
Description
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.
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.
prim:
#include<stdio.h>
int main(){
int tre[102][102];
int n;
while(~scanf("%d",&n)){
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
scanf("%d",&tre[i][j]);
}
int min[102]={0};
int sum=0;int cmp;int mi=1000000;
min[1]=1;//1表示点被连进来了
int minsum[102];
for(int r=1;r<=n;r++){
minsum[r]=tre[1][r];
}
for(int k=1;k<=n-1;k++)
{
mi=1000000;
for(int t=1;t<=n;t++){
if(min[t]!=1&&minsum[t]>0&&minsum[t]<mi){
cmp=t;
mi=minsum[t];//得到min
}
}
sum+=mi;
min[cmp]=1;//该点被连接
//进行更新
for(int yy=1;yy<=n;yy++)
{
if(min[yy]==1){
for(int hh=1;hh<=n;hh++){
if(min[hh]!=1){
if(tre[yy][hh]<minsum[hh])
minsum[hh]=tre[yy][hh];
}
}
}
}
}
printf("%d\n",sum);
}
return 0;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。
today lazy . tomorrow die .