标签：hdu1102

Constructing Roads

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 13756    Accepted Submission(s): 5223

3
0 990 692
990 0 179
692 179 0
1
1 2

179

这题坑人的地方就是题目实际上是多组数据的...

#include <stdio.h>
#include <string.h>
#define maxn 102

int map[maxn][maxn];
bool vis[maxn];

void Prim(int n)
{
	int i, j, len = 0, count = 0, tmp, u;
	vis[1] = 1;
	while(count < n - 1){
		for(i = 1, tmp = -1; i <= n; ++i){
			if(!vis[i]) continue;
			for(j = 1; j <= n; ++j)
				if(!vis[j] && (map[i][j] < tmp || tmp == -1)){
					tmp = map[i][j]; u = j;
				}
		}
		if(tmp != -1){
			++count;
			vis[u] = 1;
			len += tmp;
		}
	}
	printf("%d\n", len);
}

int main()
{
	//freopen("in.txt", "r", stdin);
	//freopen("out.txt", "w", stdout);
	int n, q, a, b, i, j;
	while(scanf("%d", &n) != EOF){
		memset(vis, 0, sizeof(vis));
		for(i = 1; i <= n; ++i)
			for(j = 1; j <= n; ++j)
				scanf("%d", &map[i][j]);
		scanf("%d", &q);
		while(q--){
			scanf("%d%d", &a, &b);
			map[a][b] = map[b][a] = 0;
		}
		Prim(n);
	}
	return 0;
}

HDU1102 Constructing Roads 【最小生成树Prim】,布布扣,bubuko.com

HDU1102 Constructing Roads 【最小生成树Prim】

标签：hdu1102

原文地址：http://blog.csdn.net/chang_mu/article/details/38261875