More is better HDU - 1856

最新推荐文章于 2026-06-19 13:27:13 发布

原创最新推荐文章于 2026-06-19 13:27:13 发布 · 320 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#并查集

这篇博客探讨了如何解决一个复杂项目的人选问题，通过并查集（Disjoint Set）的数据结构来优化处理大量的朋友关系。博主提供了两种实现方式，其中第二种引入了路径压缩，减少了查找和合并操作的时间复杂度。代码示例展示了如何初始化并查集，以及在给定朋友对的情况下进行合并，最终找出最大可能保留的男孩数量。强调了初始化的重要性，并祝愿读者在ACM竞赛中取得成功。

Mr Wang wants some boys to help him with a project. Because the project is rather complex, the more boys come, the better it will be. Of course there are certain requirements.

Mr Wang selected a room big enough to hold the boys. The boy who are not been chosen has to leave the room immediately. There are 10000000 boys in the room numbered from 1 to 10000000 at the very beginning. After Mr Wang's selection any two of them who are still in this room should be friends (direct or indirect), or there is only one boy left. Given all the direct friend-pairs, you should decide the best way.

Input

The first line of the input contains an integer n (0 ≤ n ≤ 100 000) - the number of direct friend-pairs. The following n lines each contains a pair of numbers A and B separated by a single space that suggests A and B are direct friends. (A ≠ B, 1 ≤ A, B ≤ 10000000)

Output

The output in one line contains exactly one integer equals to the maximum number of boys Mr Wang may keep.

Sample

Inputcopy	Outputcopy
4 1 2 3 4 5 6 1 6 4 1 2 3 4 5 6 7 8	4 2

Inputcopy

Outputcopy

4 
2

一定要初始化！一定要初始化！一定要初始化！一定要初始化！一定要初始化！一定要初始化！

我写了两种做法，第二种的时间会比较少，实现了路径压缩，每次利用find函数查找时，省了一部分时间。

第一种：

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>

using namespace std;
const int N = 10000000;

int f[N], cnt[N];

void init() {
    for (int i = 1; i <= 10000000; i++) {
        f[i] = i;
        cnt[i] = 1;
    }
}

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

void merge(int a, int b) {
    a = find(a);
    b = find(b);
    if (a != b) {
        f[a] = b;
        cnt[b] += cnt[a];
    }
}

int main() {
    int n;
    while (scanf("%d", &n) != EOF) {
        init();
        for (int i = 1; i <= n; i++) {
            int a, b;
            scanf("%d%d", &a, &b);
            merge(a, b);
        }
        int res = 0;
        for (int i = 1; i <= N; ++i) {
            res = max(res, cnt[find(i)]);
        }
        cout << res << endl;
    }

    return 0;
}

第二种：

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 10000000;

int root[N], f[N];

void init() {
    for (int i = 1; i <= N; i++) {
        root[i] = 0;
        f[i] = i;
    }
}

int find(int x) {
    int r = x;
    while (x != f[x]) {
        x = f[x];
    }

    while (r != f[r]) {
        int h = r;
        r = f[r];
        f[h] = x;
        
    }

    return x;
}

void Union(int x, int y) {
    x = find(x);
    y = find(y);
    if (x != y) {
        f[x] = y;
    }
}

int main() {
    int n;
    while (scanf("%d", &n) != EOF) {
        init();
        for (int i = 1; i <= n; i++) {
            int a, b;
            scanf("%d%d", &a, &b);
            Union(a, b);
        }

        for (int i = 1; i <= N; i++) {
            root[find(i)]++;
        }

        int res = 0;
        for (int i = 1; i <= N; i++) {
            res = max(res, root[i]);
        }

        printf("%d\n", res);
    }

    return 0;
}

最后祝各位安好，愿acm之路顺利！！