哈利波特的考试

输入样例:

6 11
3 4 70
1 2 1
5 4 50
2 6 50
5 6 60
1 3 70
4 6 60
3 6 80
5 1 100
2 4 60
5 2 80
结尾无空行

输出样例:

4 70
结尾无空行

代码：

#include<iostream>
#define Maxsize 101
#define INF 65535
using namespace std;
int animal[Maxsize][Maxsize];
int N,M;
int main()
{
	cin >> N >> M;
	for (int i = 0; i <=N; i++) {
		for (int j = 0; j <= N; j++) {
			if (i == j) {
				animal[i][j] = 0;
			}
			else {
				animal[i][j] = INF;
			}
		}
	}
	for (int k = 0; k < M; k++) {
		int  i, j, length;
		cin >> i >> j >> length;
		animal[i][j] = animal[j][i] = length;
	}
	//核心代码Floyd算法
	//得出所有顶点到所有顶点的最短路径 
	for (int k = 1; k <= N; k++) {
		for (int i = 1; i <= N; i++) {
			for (int j = 1; j <= N; j++) {
				if (animal[i][j] > animal[i][k] + animal[k][j]) {
					animal[i][j] = animal[i][k] + animal[k][j];
				}
			}
		}
	}
	int index = 0;
	int min = INF;
	int max;
	for (int i = 1; i <= N; i++) {
		max = 0;
		for (int j = 1; j <= N; j++) {
			if (max <= animal[i][j]) {
				max = animal[i][j];
			}
		}
		if (min > max) {
			min = max;
			index = i;
		}
	}
	//当有无法变成的动物时，max会等于INF   
	if (index == 0) {
		cout <<"0"<< endl;
	}
	else {
		cout << index << " " << min;
	}
    return 0;
}