UVa 10685 - Nature

题目：自然间中的食物链，已知一些捕食关系，求最大的食物链网的大小。

分析：并查集。利用并查集合并集合求出最大的集合元素个数，利用hash存储名字。

说明：还以为求最长的路径(⊙v⊙)。

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

//union_set__begein
int  union_sets[5005];
int  union_rank[5005];
int  union_sums[5005];

void union_initial(int s, int t) {
	for (int i = s ; i <= t; ++ i) {
		union_sets[i] = i;
		union_rank[i] = 0;
		union_sums[i] = 1;
	}
}

int union_union(int a, int b) {
	if (union_rank[a] > union_rank[b]) {
		union_sets[b] = a;
		union_sums[a] += union_sums[b];
		return union_sums[a];
	}else {
		union_sets[a] = b;
		if (union_rank[a] == union_rank[b])
			union_rank[b] ++;
		union_sums[b] += union_sums[a];
		return union_sums[b];
	}
}

int union_find(int a) {
	if (a != union_sets[a])
		union_sets[a] = union_find(union_sets[a]);
	return union_sets[a];
}
//union_set__end

//hash__begin
typedef struct hnode {
	int    id;
	char   name[32];
	hnode* next;
}hnode;
hnode* hash_list[1000007];
int    hash_size;
hnode  hash_node[5005];

void hash_initial() {
	hash_size = 0;
	memset(hash_list, 0, sizeof(hash_list));
}

int hash_find(char str[]) {
	int id = 0;
	for (int i = 0; str[i]; ++ i)
		id = (id*128+str[i])%1000007;
	for (hnode* p = hash_list[id]; p; p = p->next)
		if (!strcmp(str, p->name))
			return p->id;
	
	hash_node[hash_size].next = hash_list[id];
	hash_node[hash_size].id   = hash_size;
	hash_list[id] = &hash_node[hash_size];
	strcpy(hash_node[hash_size].name, str);
	return hash_size ++;
}

int hash_insert(char str[]) {
	hash_find(str);
}
//hash__end

char name1[32];
char name2[32];

int main()
{
	int C, R;
	while (scanf("%d%d",&C,&R) && C) {
		getchar();
		hash_initial();
		for (int i = 0; i < C; ++ i) {
			scanf("%s",name1);
			hash_insert(name1);
		}
		union_initial(0, C-1);
		for (int i = 0; i < R; ++ i) {
			scanf("%s%s",name1,name2);
			int A = union_find(hash_find(name1));
			int B = union_find(hash_find(name2));
			if (A != B) {
				union_union(A, B);
			}
		}
		int max = 1;
		for (int i = 0; i < C; ++ i) {
			if (max < union_sums[i]) {
				max = union_sums[i];
			}
		}
		printf("%d\n",max);
		char c = getchar();
		if (c >= '0' && c <= '9') {
			ungetc(c, stdin);
		}
	}
	return 0;
}