哈利波特的考试
#include<iostream>
#include<queue>
#include<string.h>
using namespace std;
int vertex, edge;
int G[101][101];
int flag[101];
int n, m;
const int inf=100000001;
void floyed()
{
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if(G[i][j]> G[i][k] + G[k][j])
G[i][j] = G[i][k] + G[k][j];
}
void getmin()
{
int count = 0, k=0;
int allmin = inf;
bool flag;
for (int i = 1; i <= n; i++)
{
int max = -1; flag = 1;
for (int j = 1; j <= n; j++)
{
if (G[i][j] > max)
max = G[i][j];
if (G[i][j] == inf)
{
flag = 0;
break;
}
}
if (flag)
{
count++;
if (max < allmin)
{
allmin = max;
k = i;
}
}
}
if (count == 0)
cout << "0" << endl;
else
cout << k << " " << allmin << endl;
}
int main()
{
int v1, v2, weight;
cin >> n >> m;
for (int i = 1; i <= n; ++i)
{
for (int j = 1;j <= n; ++j)
{
if (i != j)
G[i][j] = inf;
}
}
for (int i = 0; i < m; ++i)
{
cin >> v1 >> v2 >> weight;
G[v1][v2] = weight;
G[v2][v1] = weight;
}
floyed();
getmin();
return 0;
}