uva 10608 并查集个数

题意：

解析：

代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <stack>
#include <vector>
#include <queue>
#include <map>
#include <climits>
#include <cassert>
#define LL long long

using namespace std;
const int maxn = 30000 + 10;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const double pi = 4 * atan(1.0);
const double ee = exp(1.0);

int n, m;
int fa[maxn];
int num[maxn];

void Init()
{
    for (int i = 1; i <= n; i++)
    {
        fa[i] = i;
        num[i] = 1;
    }
}

int Find(int x)
{
    if (fa[x] != x)
        fa[x] = Find(fa[x]);
    return fa[x];
}

void Union(int u, int v)
{
    int fau = Find(u);
    int fav = Find(v);
    if (fau != fav)
    {
        fa[fav] = fau;
        num[fau] += num[fav];
        num[fav] = 0;
    }
}

int main()
{
    #ifdef LOCAL
    freopen("in.txt", "r", stdin);
    #endif // LOCAL
    int ncase;
    scanf("%d", &ncase);
    while (ncase--)
    {
        scanf("%d%d", &n, &m);
        Init();
        for (int i = 0; i < m; i++)
        {
            int u, v;
            scanf("%d%d", &u, &v);
            Union(u, v);
        }
        int maxx = 0;
        for (int i = 1; i <= n; i++)
        {
            if (maxx < num[i])
                maxx = num[i];
        }
        printf("%d\n", maxx);
    }
    return 0;
}