hdu1181（变形课)-并查集

#include<stdio.h>
#include<string.h>
int father[26];
void init(){
int i;
for(i=0;i<26;i++){
father[i]=i;
}
}
int find(int x){
while(x!=father[x]){
x=father[x];
}
return x;
}
bool finda(int a,int b){
int flag=0;
while(a!=father[a]){
a=father[a];
if(a==b){
flag=1;
break;
}
}
if(flag==1)
return true;
else
return false;
}
int main(){
char s[1000];
init();
while(gets(s)){
if(s[0]=='0'){
if(finda('b'-'a','m'-'a'))
printf("Yes.\n");
else
printf("No.\n");
init();
}
int len;
len=strlen(s);
int a=find(s[0]-'a');
int b=find(s[len-1]-'a');
if(a!=b)
father[a]=b;
}
return  0;
}