牛客-凤凰

最新推荐文章于 2024-09-14 16:21:49 发布

念兮兮

最新推荐文章于 2024-09-14 16:21:49 发布

阅读量95

点赞数

分类专栏：每日练习文章标签：深度优先 c++ 图论

本文链接：https://blog.csdn.net/qq_52081267/article/details/127168261

版权

每日练习专栏收录该内容

18 篇文章 0 订阅

订阅专栏

原题链接

解题思路：本题就是求与1相连的子树的中节点个数的最多的子树节点的个数，我们可以用并查集和dfs求解

C++代码

并查集

#include <bits/stdc++.h>
#define int long long 
using namespace std;
const int N = 1e6 + 10;
int p[N], d[N];
int n;

int find(int x)
{
    if (x != p[x]) p[x] = find(p[x]);
    return p[x];
}

signed main()
{
    cin >> n;
    for (int i = 1; i <= n; i ++ ) p[i] = i;
    for (int i = 1; i <= n - 1; i ++ )
    {
        int a, b;
        cin >> a >> b;
        if (a != 1 && b != 1) 
        {
            int pa = find(a), pb = find(b);
            if (pa != pb) p[pa] = pb;
        }
    }
    for (int i = 1; i <= n; i ++ )
    {
        ++ d[find(i)];
    }
    int maxn = -2e9;
    for (int i = 1; i <= n; i ++ )
    {
        maxn = max(maxn, d[i]);
    }
    cout << maxn << endl;
    return 0;
}

dfs

#include <bits/stdc++.h>
// #define int long long 
using namespace std;
const int N = 1e6 + 10, M = 2 * N;
int h[N], e[M], ne[M], idx;
int n, maxn, num[N];

void add(int a, int b)  // 添加一条边a->b
{
    e[idx] = b, ne[idx] = h[a], h[a] = idx ++ ;
}


void dfs(int u, int fa)
{
    num[u] = 1;
    for (int i = h[u]; ~i; i = ne[i])
    {
        int j = e[i];
        if (j == fa) continue;
        dfs(j, u);
        num[u] += num[j];
    }
    if (u != 1) maxn = max(maxn, num[u]);
}

signed main()
{
    memset(h, -1, sizeof h);
    cin >> n;
    int a, b;
    for (int i = 1; i < n; i ++ )
    {
        cin >> a >> b;
        add(a, b), add(b, a);
    }
    dfs(1, -1);
    cout << maxn << endl;
    return 0;
}