【代码超详解】POJ 1502 MPI Maelstrom（Dijkstra 模板题）

一、题目描述

二、算法分析说明与代码编写指导

三、AC 代码

#include<cstdio>
#include<algorithm>
#include<bitset>
#include<cctype>
#pragma warning(disable:4996)
using namespace std;
unsigned A[101][101], n, N, e[101], x; bitset<101> v; const unsigned emax = 1 << 30; int c; bool flag;
int main() {
	scanf("%u", &n);
	for (unsigned i = 1; i <= n; ++i) { fill(A[i] + 1, A[i] + n + 1, emax); A[i][i] = 0; }
	for (unsigned i = 2; i <= n; ++i) {
		for (unsigned j = 1; j < i; ++j) {
			flag = false;
			for (;;) {
				c = getchar();
				if (c <= 32)continue;
				else if (c == 'x') { flag = true; break; }
				else { ungetc(c, stdin); break; }
			}
			if (flag == true)continue;
			scanf("%u", &A[i][j]); A[j][i] = A[i][j];
		}
	}
	fill(e, e + n + 1, emax); e[1] = 0;
	while (N != n) {
		x = 0; for (unsigned i = 1; i <= n; ++i)if (v[i] == false && e[i] < e[x])x = i;
		for (unsigned y = 1; y <= n; ++y) { e[y] = min(e[y], e[x] + A[x][y]); }
		v[x] = true; ++N;
	}
	printf("%u\n", *max_element(e + 1, e + n + 1));
	return 0;
}