boj 312

并查集---可能是我水过最多的算法。。。。

#include<iostream>
using namespace std;

#define N 50005 
#define M 105
int colorClass[N];
int father[M];

int findFather(int i)
{
	if(father[i]!=i)
		father[i]=findFather(father[i]);
	return father[i];
}
void union_set(int a,int b)
{
	int fa=findFather(a);
	int fb=findFather(b);
	fa<fb?father[fb]=fa:father[fa]=fb;
}
int main()
{
	int n,m;
	scanf("%d%d",&n,&m);
	while(!(n==0&&m==0))
	{
		for(int i=0;i<n;i++)
			scanf("%d",&colorClass[i]);
		for(int i=1;i<=m;i++)
			father[i]=i;
		int k;
		scanf("%d",&k);
		for(int i=0;i<k;i++)
		{
			int a,b;
			scanf("%d%d",&a,&b);
			union_set(a,b);
		}
		int cnt=1;
		findFather(colorClass[0]);
		for(int i=1;i<n;i++)
		{
			if(father[colorClass[i-1]]!=findFather(colorClass[i]))
				cnt++;
		}
		printf("%d\n",cnt);
		scanf("%d%d",&n,&m);
	}
}