Union Find Set Algorithm

namespace UFS{
    int n,m,t,pos[MAXN],k,a,b,c,fa[MAXN];
    inline int find(int x){
        return x==fa[x] ? x : fa[x] = find(fa[x]);
    }
    inline void Union(int x, int y){
        fa[find(x)] = find(y);
    }
}