[ybtoj advanced training guide] maximum separation [hash] [Floyd]

Ideas ：

Just use your name hash save , When you meet a new one, open one , then Floyd
This is used here. map

$code$

#include<iostream>
#include<map>
#include<cstring> 
#include<cstdio>

using namespace std;

int n, m;
int dis[55][55];
map<string, int> a;

int main()
{
    
	int t=0;
	while(1)
	{
    
		t++;
		scanf("%d%d", &n, &m);
		if(n==m&&n==0)
			break;
		a.clear();
		memset(dis, 0x3f3f3f3f3f, sizeof(dis));
		for(int i=1; i<=n; i++)	dis[i][i]=0;
		for(int i=1, j=0; i<=m; i++)
		{
    
			string s1, s2;
			cin>>s1>>s2;
			if(a[s1]==0)
				a[s1]=++j;
			if(a[s2]==0)
				a[s2]=++j;
			dis[a[s1]][a[s2]]=dis[a[s2]][a[s1]]=1;
		}
		for(int k=1; k<=n; k++)
			for(int i=1; i<=n; i++)
				for(int j=1; j<=n; j++)
					if(dis[i][j]>dis[i][k]+dis[k][j])
						dis[i][j]=dis[i][k]+dis[k][j];
		int ans=0;
		for(int i=1; i<=n; i++)
			for(int j=1; j<=n; j++)
				ans=max(ans, dis[i][j]);
		if(ans==1061109567)
			printf("Network %d: DISCONNECTED\n", t);
		else printf("Network %d: %d\n", t, ans);
	}
	return 0;
}
/* 4 4 Ashok Kiyoshi Ursala Chun Ursala Kiyoshi Kiyoshi Chun */