[Luogu] 选学霸

https://www.luogu.org/problemnew/show/P2170

并查集+DP

#include <iostream>
#include <cstring>
#include <cmath>
using namespace std;
const int maxn=;
int n,m,k,tot;
int p[maxn];
int man[maxn];
int f[maxn+maxn];
int find(int x) {
    return (x==p[x]?x:p[x]=find(p[x]));
}
void solve() {
    memset(f,,sizeof(f));
    for(int i=; i<=tot; i++)
        for(int j=*m; j>=man[i]; j--)
            f[j]=max(f[j],f[j-man[i]]+man[i]);
    for(int i=; i<=m; i++) {
        if(f[m-i]==m-i) {
            cout<<m-i<<endl;
            return;
        }
        if(f[m+i]==m+i) {
            cout<<m+i<<endl;
            return;
        }
    }
    return;
}
int main() {
    cin>>n>>m>>k;
    int u,v;
    for(int i=; i<=n; i++)
        p[i]=i;
    for(int i=; i<=k; i++) {
        cin>>u>>v;
        int x=find(u);
        int y=find(v);
        p[x]=y;
    }
    memset(man,,sizeof(man));
    for(int i=; i<=n; i++)
        man[find(i)]++;
    tot=;
    for(int i=; i<=n; i++)
        if(man[i]!=) man[++tot]=man[i];
    solve();
    return ;
}