ZOJ 1082 最短路

floyd 即可

#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

typedef  long long LL;
const double PI = acos(-1.0);

template <class T> inline  T MAX(T a, T b){if (a > b) return a;return b;}
template <class T> inline  T MIN(T a, T b){if (a < b) return a;return b;}

const int N = 111;
const int M = 11111;
const LL MOD = 1000000007LL;
const int dir[4][2] = {1, 0, -1, 0, 0, -1, 0, 1};
const int INF = 0x3f3f3f3f;


int mp[111][111];



int main()
{
	int n;
	while (scanf("%d", &n), n)
	{
		int a, t, i, j, k, u, v, w, m;
		for (i = 1; i <= n; ++i)
		{
			fill(mp[i] + 1, mp[i] + n + 1, INF);
			mp[i][i] = 0;
		}
		for (i = 1; i <= n; ++i)
		{
			scanf("%d", &m);
			for (j = 1; j <= m; ++j)
			{
				scanf("%d%d", &a, &t);
				mp[i][a] = t;
			}
		}
		for (k = 1; k <= n; ++k)
			for (i = 1; i <= n; ++i)
				for (j = 1; j <= n; ++j)
				{
					if (mp[i][j] > mp[i][k] + mp[k][j])
					{
						mp[i][j] = mp[i][k] + mp[k][j];
					}
				}
		int pos, mm = INF;
		for (i = 1; i <= n; ++i)
		{
			int ans = -1;
			for (j = 1; j <= n; ++j)
				ans = MAX(ans, mp[i][j]);
			if (ans < mm)
			{
				mm = ans; pos = i;
			}
		}
		if (mm == INF)
		{
			printf("disjoint\n");
		}
		else
		{
			printf("%d %d\n", pos, mm);
		}
	}
	return 0;
}