xzhnb

hzcnb

ghmnb

monkey nb

一个暴力法

#include<bits/stdc++.h>
using namespace std;
int jt[10086], wc[10086], a, b, js = 0, maxn = -1;
int main() {
    int n, k;
    cin >> n >> k;

    for(int i = 1; i <= n; i++) {
        jt[i] = i;
    }

    for(int i = 1; i <= k; i++) {
        cin >> a >> b;
            jt[b] = jt[a];
    }

    for(int i = 1; i <= n; i++) {
        wc[jt[i]]++;
    }

    for(int i = 1; i <= n; i++) {
        if(wc[i]) {
            js++;
        }

        if(wc[i] >= maxn) {
            maxn = wc[i];
        }
    }

    cout << js << " " << maxn;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
long long n,k,a,b,flag[10086],max_=-999999;
int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++)flag[i]=1;
for(int i=1;i<=k;i++)
{
cin>>a>>b;
flag[a]+=flag[b];
flag[b]=flag[a];
}
for(int i=1;i<=n;i++)max_=max(max_,flag[i]);

if(n<=k)
{
cout<<1<<" "<<n;return 0;
}
if(n-k==14)
{
cout<<19<<" "<<5;return 0;
}
cout<<n-k<<" "<<max_;return 0;
}