并查集-杭电1856-More is better-难度1
来源:互联网 发布:淘宝活动海报投放 编辑:程序博客网 时间:2024/04/29 04:03
Problem Description
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.
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 Input
41 23 45 61 641 23 45 67 8
Sample Output
42
题目要求: 求最大连通分量。
代码:
#include <iostream>using namespace std;const int MAX = 10000001;int boy[MAX];int friends[MAX];int findRoot(int x){if(boy[x] == -1)return x;//如果x是根节点,则返回xelse{boy[x] = findRoot(boy[x]);//如果x不是根节点,则查找x上一个节点的根节点//并且把x的上一节点赋值为根节点return boy[x];// 一定要返回根节点}}int main(){//freopen("F:\\input.txt", "r", stdin);//freopen("F:\\output.txt", "w", stdout);int M;//M 表示朋友对数while(cin >> M){for(int i = 1; i < MAX; i++){boy[i] = -1;friends[i] = 1;}for(int i = 0; i != M; ++i ){int a, b;// a,b 表示输入的两个节点cin >> a >> b;int x, y;x = findRoot(a);y = findRoot(b);// x, y分别表示a,b的根节点if(x != y){boy[x] = y;friends[y] = friends[y] + friends[x];//把根节点x下的节点加到根节点y下}}int max = 0;//max表示朋友最多集的朋友个数for(int i = 1; i < MAX; i++){if(friends[i] > max)max = friends[i];}cout << max << endl;}return 0;}
0 0
- 并查集-杭电1856-More is better-难度1
- 杭电1856More is better(并查集)
- hdu杭电1856 More is better【并查集】
- 杭电 hdu 1856 More is better (并查集)
- More is better(杭电1856)(并查集)
- 杭电 hdu 1856 More is better (并查集)
- More is better hdu1856 并查集
- hdu1856 ,More is better,并查集
- 并查集C - More is better
- HDOJ1856 More is better 【并查集】
- Hdu1856 - More is better - 并查集
- HDU1856 More is better 并查集
- More is better(并查集)
- 并查集 HDOJ1856 More is better
- HDU1856 More is better 并查集
- More is better---并查集实践
- More is better(并查集)
- hdu1856 More is better 并查集
- 云计算(十九)- Hadoop Map/Reduce教程
- spring集成memcache 示例一
- Passbook详解与开发案例
- MotionEvent事件在onInterceptTouchEvent()、onTouchEvent()中的传递顺序(转)
- 温故而知新,回顾一个头文件定义变量的问题
- 并查集-杭电1856-More is better-难度1
- hadoop配置详细教程
- spring集成memcache 示例二
- jquery鼠标经过导航条改变背景图
- 基于visual Studio2013解决面试题之0510连续数之和
- eclipse建立的Dynamic Web project中为什么没有.xml文件
- SequoiaDB 1.5 版本发布
- IOS面经系列(四)常见的问题
- 数据库服务和实例