弄了n年,终于弄出了个并查集的模板。贴上备忘。
#include <stdio.h>
#include <string.h>
#define CLR(a,v) memset(a,v,sizeof(a))
#define N 50010
int pre[N],rank[N];
void Init()
{
CLR(pre,-1);CLR(rank,0);
}
int Find(int x)
{
if(pre[x] != -1)
return pre[x] = Find(pre[x]);
else
return x;
}
void Union(int a,int b)
{
int r1 = Find(a);
int r2 = Find(b);
if(r1 == r2)
return ;
if(rank[r1] > rank[r2])
pre[r2] = r1;
else
{
pre[r1] = r2;
if(rank[r1] == rank[r2])
++rank[r2];
}
}