poj 1258 Agri-Net 【最小生成树 基础题】
来源:互联网 发布:matlab读取txt数据 编辑:程序博客网 时间:2024/06/07 04:41
Agri-Net
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 43572 Accepted: 17819
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
明天要考英语了,睡前水一道,困死了。
prime:
#include <cstdio>#include <cstring>#define MAX 100+1#define INF 0x3f3f3f using namespace std;int map[MAX][MAX], low[MAX];int vis[MAX];int n;void getmap(){ int i, j; for(i = 1; i <= n; i++) { for(j = 1; j <= n; j++) { scanf("%d", &map[i][j]); } }}void prime(){ int i, j; int next, Min, mincost = 0; for(i = 1; i <= n; i++) { vis[i] = 0; low[i] = map[1][i]; } vis[1] = 1; for(i = 2; i <= n; i++) { Min = INF; for(j = 1; j <= n; j++) { if(!vis[j] && Min > low[j]) { Min = low[j]; next = j; } } vis[next] = 1; mincost += Min; for(j = 1; j <= n; j++) { if(!vis[j] && map[next][j] < low[j]) { low[j] = map[next][j]; } } } printf("%d\n", mincost);}int main(){ while(scanf("%d", &n) != EOF) { getmap(); prime(); } return 0;}
0 0
- poj 1258 Agri-Net 【最小生成树 基础题】
- POJ-1258--Agri-Net---最小生成树基础题
- POJ 1258 Agri-Net(最小生成树)
- POJ 1258 Agri-Net 【最小生成树】
- Agri-Net - POJ 1258 最小生成树
- POJ 1258 Agri-Net 最小生成树
- POJ 1258 Agri-Net(最小生成树)
- POJ 1258 Agri-Net 最小生成树
- POJ 1258 Agri-Net 最小生成树
- poj 1258 Agri-Net(最小生成树)
- poj 1258 Agri-Net 最小生成树
- Poj 1258 Agri-Net【最小生成树】
- poj 1258 Agri-Net 最小生成树
- POJ 1258Agri-Net 最小生成树
- POJ 1258 :Agri-Net(最小生成树)
- POJ 1258 Agri-Net (最小生成树)
- poj 1258 Agri-Net 最小生成树
- 最小生成树-POJ 1258 Agri-Net
- HihoCoder第十周:后序遍历
- ADO处理字符串时为何不需要特殊转换
- Linux系统环境变量PATH
- SwingWorker 简单使用方法
- 仪表自动测试和运维
- poj 1258 Agri-Net 【最小生成树 基础题】
- OK6410挂载Ubuntu12.04中NFS文件系统
- 如何下载STM32固件库----2015/5/29
- CSS知识总结
- 以Python Imaging Library 进行影像资料处理PIL
- 共轭梯度法原理与实现
- java连接SQL数据库
- HDU-1233 最小生成树 Prim算法
- oracle 数据库基本命令