acwing836合并集合(并查集)

1.查找树头并压缩路径

```cpp
#include<iostream>

using namespace std;
const int N=1e5+10;
int p[N];
int find(int x)
{
    if(p[x]!=x) p[x] = find(p[x]);
    return p[x];
}

int main()
{
    int n,m;
    int a,b;
    char op[2];
    cin>>n>>m;
    for(int i=1;i<=n;i++)   p[i] = i;
    while(m--)
    {
        cin>>op>>a>>b;

        
        if(op[0]=='M')  p[find(a)] = find(b);
        else
        {
            if(find(a)==find(b)) cout<<"Yes"<<endl;
            else    cout <<"No"<<endl;
        }
    }
    return 0;
}

acwing 836
```