Harry Potter's Exam，哈利波特的考试(PTA)

题意:哈利波特要去考试，他只能一个动物，他要带的这个动物要是变成其他动物是用spell（魔咒）最少的

思路:Floyd，然后找Floyd矩阵后的每行的最大（每个点到其他点消耗魔咒的最大），从这个最大中找一个最小

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cctype>
#define MAXVERTEXNUM 110
#define INF 1000000
using namespace std;

int Nv, Ne;
int MGraph[MAXVERTEXNUM][MAXVERTEXNUM];

void Floyd()
{
    for (int k = 0; k < Nv; ++k)
    {
        for (int i = 0; i < Nv; ++i)
        {
            for (int j = 0; j < Nv; ++j)
            {
                if (MGraph[i][k] + MGraph[k][j] < MGraph[i][j])
                    MGraph[i][j] = MGraph[i][k] + MGraph[k][j];
            }
        }
    }
}

int main(void)
{
    ios::sync_with_stdio(false);
    cin >> Nv >> Ne;

    for (int i = 0; i < Nv; ++i)
    {
        for (int j = 0; j < Nv; ++j)
        {
            if (i == j)
                MGraph[i][j] = 0;
            else
                MGraph[i][j] = INF;
        }
    }

    for (int i = 0; i < Ne; ++i)
    {
        int V1, V2, E;
        cin >> V1 >> V2 >> E;
        MGraph[V1-1][V2-1] = E;
        MGraph[V2-1][V1-1] = E;
    }

    Floyd();

    int MinDis, MaxDis, Animal;
    MinDis = INF;
    for (int i = 0; i < Nv; ++i)
    {
        MaxDis = 0;
        for (int j = 0; j < Nv; ++j)
        {
            if (MGraph[i][j] == INF)
            {
                cout << 0 << endl;
                return 0;
            }
            if (i != j && MGraph[i][j] > MaxDis)
                MaxDis = MGraph[i][j];
        }
        if (MaxDis < MinDis)
        {
            MinDis = MaxDis;
            Animal = i + 1;
        }
    }

    cout << Animal << ' ' << MinDis << endl;

    return 0;
}