Agri-Net
来源:互联网 发布:淘宝宝贝无线端连接 编辑:程序博客网 时间:2024/05/17 02:22
Agri-Net
Time Limit: 1000MS
Memory Limit: 10000KTotal Submissions: 39895
Accepted: 16227
Memory Limit: 10000KTotal Submissions: 39895
Accepted: 16227
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.
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
40 4 9 214 0 8 179 8 0 1621 17 16 0
Sample Output
28
最小生成树的变形
<span style="font-size:18px;color:#33cc00;">#include <iostream>#include<stdio.h>#include<string.h>using namespace std;int dis[1001],vis[1001];int map[1001][1001];#define Inf 0x3f3f3f3fint prime(int m){ int i,j,ans=0,pos,min; memset(vis,0,sizeof(vis)); for(i=2; i<=m; i++) { dis[i]=map[1][i]; } vis[1]=0; pos=1; for(i=1; i<m; i++) { min=Inf; for(j=2; j<=m; j++) { //cout<<min<<' '<<dis[j]<<endl; if(vis[j]==0&&min>dis[j]) { min=dis[j]; pos=j; } } vis[pos]=1; ans+=min; for(j=2; j<=m; j++) { if(vis[j]==0&&dis[j]>map[pos][j]&&<u>pos!=j</u>)//注意!!! { dis[j]=map[pos][j]; } } //cout<<min<<endl; } return ans;}int main(){ int m,i,j; while(scanf("%d",&m)!=EOF) { memset(map,Inf,sizeof(map)); for(int i=1; i<=m; i++) for(int j=1; j<=m; j++) { scanf("%d",&map[i][j]); } printf("%d\n",prime(m)); }}</span>
0 0
- Agri-Net
- Agri-Net
- Agri-Net
- Agri-Net
- Agri-Net
- Agri-Net
- Agri-Net
- Agri-Net
- Agri-Net
- Agri-Net
- Agri-Net
- Agri-Net
- Agri-Net
- Agri-Net
- Agri-Net
- Agri-Net
- Agri-Net
- Agri-Net
- Java类加载机制
- 不要62 hdoj 2089
- 博弈
- MetaQ (RocketMQ) 小包消息优化项目中期总结
- 同步,异步,并发的区别
- Agri-Net
- Ubuntu 14.04 LTS Eclipse菜单解决方案(小笔记)
- Android中dip和px以及转关于换的总结
- codeforces 148 D. Bag of mice(概率dp)
- Java.io.File详解
- Moravec角点检测缺点分析
- Oracle 树操作(select…start with…connect by…prior)
- 外媒对《小时代3:刺金时代》的评价
- Virtual Friends