【dfs】Friend Chains

Friend Chains

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6136    Accepted Submission(s): 1990
 

Problem Description

For a group of people, there is an idea that everyone is equals to or less than 6 steps away from any other person in the group, by way of introduction. So that a chain of "a friend of a friend" can be made to connect any 2 persons and it contains no more than 7 persons.
For example, if XXX is YYY’s friend and YYY is ZZZ’s friend, but XXX is not ZZZ's friend, then there is a friend chain of length 2 between XXX and ZZZ. The length of a friend chain is one less than the number of persons in the chain.
Note that if XXX is YYY’s friend, then YYY is XXX’s friend. Give the group of people and the friend relationship between them. You want to know the minimum value k, which for any two persons in the group, there is a friend chain connecting them and the chain's length is no more than k . 

Input

There are multiple cases. 
For each case, there is an integer N (2<= N <= 1000) which represents the number of people in the group. 
Each of the next N lines contains a string which represents the name of one people. The string consists of alphabet letters and the length of it is no more than 10. 
Then there is a number M (0<= M <= 10000) which represents the number of friend relationships in the group. 
Each of the next M lines contains two names which are separated by a space ,and they are friends. 
Input ends with N = 0.

Output

For each case, print the minimum value k in one line. 
If the value of k is infinite, then print -1 instead.

Sample Input

3

XXX YYY ZZZ

2

XXX YYY

YYY ZZZ

0 

Sample Output

2

题意：寻找最长子链。

开始时，总是想用最短路，寻找每两个点之间最短路的最大值，用了Dijkstra，一直在t，后来才想到，这个题完全是bfs，dfs

used[]是用来标记已经跑过的点，vector <int> v[] 属于容器

首先将所有的点都设置为没有经过，即 false，经过一个点 i 时，将其压入队列中，在循环中，取队顶元素并出队，将与队顶相联系的点，依次加一，跑过的点，将used[]=true,并将该点压入队列中。

map<string,int> mp;是一种可以改变下标的类型。mp ["string"]=1;

#include <bits/stdc++.h>
#define INF 0x3f3f3f

using namespace std;
int dis[1010][1010];
bool used [1010];
vector <int> v [1010];
queue <int> q;

void dfs(int i){
	memset(used,false,sizeof(used));
	dis[0][0] = 0;
	used[i] = true;    //±ê¼ÇÒѾ­ÅܹýµÄµã 
	q.push(i);
	while(!q.empty()){
		int t = q.front();
		q.pop();
		int m = v[t].size();
		for(int j=0;j<m;j++){
			int vv = v[t][j];
			if(used[vv])
				continue;
			dis[i][vv] = dis[i][t] + 1;
			q.push(vv);
			used[vv] = true;	 
		}
	}
}

map<string,int> mp;

int main(){
	string str1,str2,str;
	int n,m;
	while(~scanf("%d",&n)){
		if(n == 0)
			break;
		mp.clear();
		for(int i=0;i<n;i++){
			cin >> str;
			mp[str] = i;
		}
		for(int i=0;i<n;i++){
			dis[i][i] = 0;
			for(int j=i+1;j<n;j++)
				dis[i][j] = dis[j][i] = INF;
		}
		scanf("%d",&m);
		for(int i=0;i<n;i++){
			v[i].clear();
		}
		while(m--){
			cin >> str1 >> str2;
			int t1 = mp[str1];
			int t2 = mp[str2];
			v[t1].push_back(t2);
			v[t2].push_back(t1);
		}
		for(int i=0;i<n;i++)
			dfs(i);
		int ans = 0;
		for(int i=0;i<n;i++){
			for(int j=i+1;j<n;j++)
				ans = max(ans,dis[i][j]);
		}
		if(ans == INF)
			ans = -1;
		printf("%d\n",ans);
	}
}