Agri-Net
Time Limit:1000MS |
|
Memory Limit:10000K |
Total Submissions:26418 |
|
Accepted:10425 |
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.
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
题目大意: 将 已知 距离的 一些点 连接起来, 总的 距离最少。
思路: 以一个点为 起始, 每次找下一个 最短 边,直到找到最小生成树。
//Memory: 208 KB Time: 16 MS
//Language: C++ Result: Accepted
#include<stdio.h>
#include<string.h>
const int MAX=1000050;
int dis[105][105],n,vir[105],t[105],sum;
void minDis(int n);
int main()
{
//freopen("in.txt","r",stdin);
int i,j;
while(scanf("%d",&n)!=EOF)
{
memset(vir,0,sizeof(vir));
sum=0;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
scanf("%d",&dis[i][j]);
minDis(n);
printf("%d\n",sum);
}
return 0;
}
void minDis(int n)
{
int i,j,temp=n,next=0,min,count=0;
vir[0]=1;
while(--temp)
{
min=MAX;
t[count++]=next; //把新找到的一个最小树的点加入t数组
for(j=0;j<count;j++)
{
for(i=0;i<n;i++)
{
if(dis[t[j]][i]<min && !vir[i])
{
min=dis[t[j]][i];
next=i;
}
}
}
vir[next]=1; //标记
sum+=min;
//printf("%d %d %d\n", min, count ,next);
}
}
分享到:
相关推荐
北大POJ1258-Agri-Net【Prim】 解题报告+AC代码
北大POJ3414-Pots 解题报告+AC代码
POJ3211--Washing Clothes
POJ水题集-----50道左右-----增加自信啊..
POJ 1038--Bugs Integrated
POJ3036--Honeycomb Walk
POJ---1456.Supermarket测试数据及答案,题目描述:A supermarket has a set Prod of products on sale. It earns a profit px for each product x∈Prod sold by a deadline dx that is measured as an integral ...
北大POJ2485-Highways【Prim】 解题报告+AC代码
北大POJ初级题-数据结构:解题报告+AC代码
POJ3259--Wormholes,使用bellman方法。
poj题目分类--acmer做题极有用资源
poj 1690 Your-Term-Project.md
poj 1240 Pre-Post-erous!.md
NULL 博文链接:https://128kj.iteye.com/blog/1705139
北大POJ2002-Squares 解题报告+AC代码
北大POJ3253-POJ3253-Fence Repair【STL优先队列】 解题报告+AC代码
poj 2827 Auto-Calculation Machine.md
用Java代码实现POJ(PKU)上题2494!
poj平台有关数据结构题的Java源码 1159 1276 2406 2502 2509 2513 2533 2778 3176
北大POJ1789-Truck History【Prim】 解题报告+AC代码