poj_1125

题目链接：http://poj.org/problem?id=1125

题意好理解。解法也简单，用Floyd即可。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
#define ll __int64
int n,m;
#define Mod 1000000007
#define N 1010
#define M 1000010
int mp[110][110];
void Init(){
	for(int i=0;i<110;i++)
		for(int j=0;j<110;j++)
			mp[i][j] = (i==j?0:M);
}
void Floyd(){
	for(int k=1;k<=n;k++)
		for(int i=1;i<=n;i++)
			for(int 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 ans = M;
	int id = -1;
	for(int i=1;i<=n;i++){
		int flag = 1;
		int res = -1;
		for(int j=1;j<=n;j++){
			if(mp[i][j] == M){
				flag = 0;
				break;
			}
			res = Max(res,mp[i][j]);
		}
		if(flag){			//flag=1 represents there is a circle
			if(ans>res){
				ans = res;
				id = i;
			}
		}
	}
	if(id == -1)
		printf("disjoint\n");
	else
		printf("%d %d\n",id,ans);
}
int main(){
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
//  freopen("out.txt","w",stdout);
#endif
	while (sf(n) != EOF && n) {
		int sz;
		int id,tim;
		Init();
		for(int i=1;i<=n;i++){
			sf(sz);
			for(int j=0;j<sz;j++){
				sfd(id,tim);
				mp[i][id] = tim;
			}
		}
		Floyd();
	}
return 0;
}