题目1444:More is better
来源:互联网 发布:无网络传奇单机破解版 编辑:程序博客网 时间:2024/05/02 00:40
- 题目描述:
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.
- 输入:
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)
- 输出:
The output in one line contains exactly one integer equals to the maximum number of boys Mr Wang may keep.
- 样例输入:
41 23 45 61 641 23 45 67 8
- 样例输出:
42
代码:
#include <stdio.h>int tree[10000000];int findRoot(int x) { if(tree[x] == -1)return x; else {int tmp = findRoot(tree[x]);tree[x] = tmp;return tmp; }}int cnt[10000000];int main() { int n; while(scanf("%d",&n)!=EOF) {for(int i=1;i<10000000;i++) { tree[i] = -1; cnt[i] = 1;}int x,y;for(int i=0;i<n;i++) { scanf("%d %d",&x,&y); x = findRoot(x); y = findRoot(y); if(x!=y) {tree[x] = y;cnt[y] += cnt[x]; //将两棵树的合并,统计出新的结点数目 }}int ans=0;for(int i=1;i<10000000;i++) { if(tree[i]==-1) {if(ans<cnt[i]) ans = cnt[i]; }}printf("%d\n",ans); } return 0;}
- 题目1444:More is better
- 题目1444:More is better
- 题目1444:More is better
- 题目1444:More is better
- 题目1444:More is better
- 【九度】题目1444:More is better
- 九度 题目1444:More is better
- 九度 题目1444:More is better
- Jobdu 题目1444:More is better
- 九度 题目1444:More is better
- 题目67:More is better
- 九度oj 题目1444:More is better
- 【九度OJ】题目1444:More is better 解题报告
- 九度考研机试教程 67-题目1444:More is better
- HDOJ 题目1856More is better(并查集)
- 九度 OJ 1444:More is better
- HDOJ More is better
- hdu More is better
- c++学习笔记(1)——环境搭建、经典教程推荐及 Visual Studio 2005/2008中如何编译和运行C++程序
- mark
- Google Map Android api V2 中使用MapView遇到CameraUpdateFactory is not initialized!的解决办法
- 设置JAVA_OPTS
- LeetCode-Pascal's Triangle
- 题目1444:More is better
- discuz通过调用函数实现同步登录与退出
- [leetcode] Merge Sorted Array
- USB 3.0 开发要点
- 利用SQOOP将数据从数据库导入到HDFS
- Android增加键值(一)
- mysql 语法
- SubSonic3.0插件分页查询速度测试
- Spring连接MySQL、Oracle和SQL Server