102. 회장뽑기(플로이드-워샬 응용) (it 취업을 위한 알고리즘 문제풀이 입문 (with C/C++) : 코딩테스트 대비) ★★★☆☆

#include <iostream>
#include <vector>

using namespace std;

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int n, a, b, score = 2147000000, cnt = 0;
	cin >> n;
	
	vector<vector<int>> V(n+1, vector<int>(n+1, 100));
	vector<int> Scores(n+1, 0);
	
	while(true)
	{
		cin >> a >> b;
		if(a == -1 && b == -1)
			break;
		V[a][b] = 1;
		V[b][a] = 1;
	}
	
	for(int k = 1; k <= n; k++)
	{
		for(int i = 1; i <= n; i++)
		{
			for(int j = 1; j <= n; j++)
			{
				V[i][j] = min(V[i][j], V[i][k] + V[k][j]);
			}
		}
	}
	
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= n; j++)
		{
			Scores[i] = max(Scores[i], V[i][j]);
		}
		score = min(score, Scores[i]);
	}
	
	for(int i = 1; i <= n; i++)
	{
		if(score == Scores[i])
			cnt++;
	}
	
	cout << score << " "<< cnt << "\n";
	
	for(int i = 1; i <= n; i++)
	{
		if(score == Scores[i])
			cout << i << " ";
	}
	return 0;
}