运行状态： Wrong Answer

---

    
        #include<bits/stdc++.h>

using namespace std;

const int N = 10005;

int n, m;

int fa[N], siz[N];
int father(int x)
{
	if(fa[x] == x) return x;
	return fa[x] = father(fa[x]);
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	
	cin >> n >> m;
	for(int i=1; i<=n; i++) fa[i] = i, siz[i] = 1;
	for(int i=1; i<=m; i++)
	{
		int u, v;
		cin >> u >> v;
		if(father(u) == father(v)) continue;
		siz[father(v)] += siz[father(u)];
		fa[father(u)] = father(v);
	}
	
	int mx = 0;
	for(int i=1; i<=n; i++) mx = max(mx, siz[father(i)]);
	cout << mx << "\n";
	
	
	return 0;
}