more is better(并查集)
2016-03-15 16:46
267 查看
题目描述
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 bigenough 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.
输入格式
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 thatsuggests A and B are direct friends. (A ≠ B, 1 ≤ A, B ≤ 10000000)
输出
The output in one line contains exactly one integer equals to the maximum number of boys Mr Wang may keep.
样例输入
31 3
1 5
2 5
4
3 2
3 4
1 6
2 6
样例输出
45
#include <stdio.h> using namespace std; #define N 10000001 int Tree ; int findRoot(int x) { if(Tree[x] == -1) { return x; } else { int tmp = findRoot(Tree[x]); Tree[x] = tmp; return tmp; } } int sum ; int main() { int n,i,a,b; while(scanf("%d",&n) != EOF) { for(i = 0;i <= N;i++) { Tree[i] = -1; sum[i] = 1; } while(n--) { scanf("%d%d",&a,&b); a = findRoot(a); b = findRoot(b); if(a != b) { Tree[a] = b; sum[b] += sum[a]; } } int ans = 1; for(i = 1;i <= N;i++) { if(Tree[i]==-1&&sum[i]>ans) { ans = sum[i]; } } printf("%d\n",ans); } return 0; }
相关文章推荐
- 第二次例会~
- HDU 1233 还是畅通工程
- 服务端备份错误的解决方法,利用fastcopy工具备份
- 学习笔记一之transient关键字&foreach循环
- SD--RV_accounting_document_create函数的代码解读
- -bash: ./scripts/mysql_install_db: /usr/bin/perl: bad interpreter: No such file
- 剑指offer 包含min函数的栈
- Xilinx SDK使用教程
- MySQL Sandbox安装使用
- SSD固态硬盘优化教程
- spring 的aop proxy 代理
- 摄像头拍照
- 从相册选相片并裁剪
- 前帮机安装说明书
- 【bzoj3694】【最短路】【树链剖分】
- Singleton 单例模式
- 快速排序一
- [Java基础] 字节流与字符流
- ViewpagerIndicator 的使用
- iOS访UC、腾讯视频播放