hdoj_1856More is better(并查集)
来源:互联网 发布:网络用语狗是什么意思 编辑:程序博客网 时间:2024/05/15 00:08
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 8846 Accepted Submission(s): 3303
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>#include<cstdio>#include<map>#include<cstring>#include<cmath>#include<vector>#include<algorithm>#include<set>#include<string>#include<queue>#include <stack>using namespace std;#pragma warning(disable : 4996)const int MAX = 10000005;int father[MAX];int ranks[MAX];/* 初始化集合 */void Make_Set(int n){for(int x = 1; x <= n; x++){father[x] = x;ranks[x] = 1;}}/* 查找x元素所在的集合,回溯时压缩路径 */int Find_Set(int x){if (x != father[x]){father[x] = Find_Set(father[x]);}return father[x];}void Union_Set(int x, int y){x = Find_Set(x);y = Find_Set(y);if (x == y) return;father[x] = y;ranks[y] = ranks[x] + ranks[y];}int main(){freopen("in.txt", "r", stdin);int n, x, y;while (scanf("%d", &n) != EOF){Make_Set(MAX);while (n--){scanf("%d %d", &x, &y);Union_Set(x, y);}int ans = -1;for(int i = 1; i <= MAX; i++){if(ranks[i] > ans){ans = ranks[i];}}cout << ans << endl;}return 0;}
- hdoj_1856More is better(并查集)
- More is better(并查集)
- more is better(并查集)
- HDU1856More is better(并查集)
- More is better (并查集)
- More is better (并查集)
- More is better(并查集)
- More is better (并查集)
- hdu 1856 More is better 并查集(二)
- hdu More is better (并查集)
- HDU1856(More is better)—并查集+树
- hdu 1856 More is better(并查集)
- hdu 1856 More is better (并查集)
- hdu1856 More is better(并查集)
- 杭电1856More is better(并查集)
- HDOJ 题目1856More is better(并查集)
- HDU 1856 More is better(基础并查集)
- hdu1856 More is better(并查集 )
- Zhejiang Provincial Programming Contest 2007 部分题解
- 从Native到Web(六), emscripten学习笔记: SDL游戏移植尝试
- 2440裸机程序——串口收发数据
- assii与unicode及CString的用法
- 如何退出恢复模式?
- hdoj_1856More is better(并查集)
- Love Ubuntu Linux
- C++map的基本操作和使用
- pcDuino上跑第一个Arduino程序_blink
- mongodb中update方法的upsert和multi
- numpy和scipy的安装
- 程序人生--一个程序员对学弟学妹建议
- Java 代码优化过程的实例介绍
- TOJ 10004 Prime Factorization