并查集模板

//并查集算法  
void init(int vn){  
    for(int i = 0;i <= vn;++i)  
        Father[i] = i;  
}  
int find(int x){  
    return (Father[x] == x) ? x :  
         Father[x] = find(Father[x]);  
}  
inline void unite(int x,int y){  
    Father[find(y)] = Father[find(x)];  
}