【2018 “百度之星”程序设计大赛 - 初赛（B）】(1001) ---- degree （并查集）

题目链接

做法：一开始想复杂了。有一个地方很重要，此图一直保证是无向简单图。也就是说一个n个顶点的图中某点的度最多是是n-1

。其次，我们发现，我们可以先找这个简单图中有多少个连通块，找最多度的顶点所在的连通块，把其余连通块连接在这个顶点上，在最多减掉k条边，再连接上。所以答案一定为min(n-1, 连通块-1 + 最大度数+ k);

AC代码：

#include<bits/stdc++.h>
#define rep(i,s,t) for(int i = (int)(s); i <= (int)(t); i++)
#define rev(i,t,s) for(int i = (int)(t); i >= (int)(s); i--)
#define pb(x) push_back(x)
#define all(x) x.begin(),x.end()
#define sz(x) (int)(x).size()
using namespace std;
typedef long long ll;
const int mod = 1e9+7;
const double PI = 4*atan(1.0);
const int maxn = 1e5+5;
const int maxm = 2e5+5;
const int inf = 0x3f3f3f3f;
struct edge{
    int u;
    int v;
};
edge e[maxm];
ll degree[maxm];
int f[maxm];
int Find(int x)
{
    return  x == f[x]?x:f[x] = Find(f[x]);
}
void Union(int x,int y)
{
    int a = Find(x);
    int b = Find(y);
    if(a!=b)
        f[a] = b;
}
bool same(int x,int y)
{
    return Find(x) == Find(y);
}
int read()
{
    char x;
    while((x = getchar())<'0' || x>'9');
    int u = x-'0';
    while((x = getchar())>='0' && x<='9') u = (u<<3)+(u<<1)+x-'0';
    return u;
}
int main()
{
    #ifdef LOCAL_FILE
    freopen("in.txt","r",stdin);
    #endif // LOCAL_FILE
    int t;
    t = read();
    while(t--)
    {
        memset(degree,0,sizeof(degree));
        memset(e,inf,sizeof(e));
        memset(f,0,sizeof(f));
        int n,m,k;
        n =read();
        m = read();
        k = read();
        rep(i,0,n-1) f[i] = i;
        rep(i,1,m)
        {
            int u,v;
            u = read();
            v = read();
            e[i].u = u;
            e[i].v = v;
            Union(u,v);
            degree[u]++;
            degree[v]++;
        }
        ll ans = *max_element(degree,degree+n);
        for(int i=0;i<n;i++)
        {
            if(f[i]==i)
                ans++;
        }
        ans--;
        printf("%I64d\n",min(ans+k,(ll)n-1));
    }
    return 0;
}