并查集算法

#include 
#include 
#include 
using namespace std;
const int N = 1e5;
int p[N];
int find(int x)  // 并查集
{
    if (p[x] == x)return x;
    return p[x] = find(p[x]);
}
void join(int a,int b)
{
    p[find(a)]=find(b);
}
int main()
{
    int n,m,a,b;
    cin>>n>>m;
    char ch;
    for (int i = 1; i <= n; i ++ )p[i]=i;
    while (m -- )
    {
        cin>>ch;
        cin>>a>>b;
        if(ch=='M')
        {
            join(a,b);
        }
        else
        {
            if(find(a)==find(b))
            cout<<"Yes"< 
 
 
参考链接