HDU1856 More is better(并查集)
来源:互联网 发布:mac视频暂停快捷键 编辑:程序博客网 时间:2024/05/29 04:41
题意:
王老师要找一些男生帮助他完成一项工程。要求最后挑选出的男生之间都是朋友关系,可以说直接的,也可以是间接地。问最多可以挑选出几个男生(最少挑一个)。
要点:
并查集水题,只要求那个集合中个数最大即可,就是数据比较大,所以rank数组就不开了。
#include<stdio.h>#include<string.h>#include<stdlib.h>#define maxn 10000000int p[maxn], num[maxn];void init(){for (int i = 1; i <= maxn; ++i){p[i] = i;num[i] = 1;}}int find(int x){if (p[x] == x) return x;return p[x] = find(p[x]);}void merge(int x, int y){x = find(x);y = find(y);if (x == y) return;p[x] = y;num[y] += num[x];}int main(){int n,x,y;while (scanf("%d", &n) != EOF){init();while (n--){scanf("%d%d", &x, &y);merge(x, y);}int max = -1;for (int i = 1; i <= maxn; i++)if (num[i] > max)max = num[i];printf("%d\n", max);}}
0 0
- More is better hdu1856 并查集
- hdu1856 ,More is better,并查集
- Hdu1856 - More is better - 并查集
- HDU1856 More is better 并查集
- HDU1856 More is better 并查集
- hdu1856 More is better 并查集
- HDU1856 More is better(并查集)
- hdu1856 More is better 并查集
- hdu1856 More is better--并查集
- hdu1856 More is better 并查集
- HDU1856(More is better)—并查集+树
- hdu1856 More is better(并查集)
- hdu1856 More is better(并查集 )
- hdu1856 More is better (并查集)
- More is better--hdu1856(并查集)
- HDU1856 More is better(并查集)
- HDU1856 More is better(并查集)
- HDU1856:More is better(并查集)
- MyBatis学习 之 一、MyBatis简介与配置MyBatis+Spring+MySql
- Django综述
- iOS webview与H5的交互
- Yii中处理前后台登录新方法
- “并发用户数”、“系统用户数”和“同时在线用户数”的计算公式
- HDU1856 More is better(并查集)
- linux 进程通信 IPC
- 一次app抓包引发的Android分析记录
- python笔记---正则表达式
- Android:EditText 多行显示、属性汇总、族谱
- 谷歌宣布Android Studio将取代Eclipse
- MySQL权限篇讨论之权限收回之级联影响
- C++ 判断磁盘是否为可移动磁盘
- 最长回文字串 (LEETCODE: Longest Palindromic Substring)