hdu 1856 并查集
2014-03-05 19:09
323 查看
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 11865 Accepted Submission(s): 4395
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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)
[align=left]Output[/align]
The output in one line contains exactly one integer equals to the maximum number of boys Mr Wang may keep.
[align=left]Sample Input[/align]
4
1 2
3 4
5 6
1 6
4
1 2
3 4
5 6
7 8
[align=left]Sample Output[/align]
4
2
Hint
A and B are friends(direct or indirect), B and C are friends(direct or indirect),
then A and C are also friends(indirect).
In the first sample {1,2,5,6} is the result.
In the second sample {1,2},{3,4},{5,6},{7,8} are four kinds of answers.
题目大意:给n个朋友对,求朋友圈人数最多的人数。
#include <iostream> #include <cstdio> using namespace std; const int maxn=10000005; int f[maxn],v[maxn]; int findset(int x) { return f[x]!=x?f[x]=findset(f[x]):f[x];}//带路径压缩 void merge(int a,int b) { int fa=findset(a); int fb=findset(b); if(fa!=fb) f[fa]=fb; } int main() { int n,a,b,i,ans; while(~scanf("%d",&n)) { ans=0; for(i=1;i<=10000000;i++) f[i]=i,v[i]=0; while(n--) { scanf("%d %d",&a,&b); merge(a,b); } for(i=1;i<=10000000;i++) v[findset(f[i])]++; for(i=1;i<=10000000;i++) ans=ans>v[i]?ans:v[i]; printf("%d\n",ans); } return 0; }
相关文章推荐
- javaweb程序中,普通的java类,不是servlet类读取资源文件的方式
- 华为OJ 一个精度问题
- 安卓开发的简易计算器
- js学习笔记 chapter7 小结
- mysql 检索数据库中包含某几个字段的表 & 检索表名称包含某些字符的表
- 零基础学小议LLVM
- java synchronized详解
- 查找整数
- SSH框架中配置log4j日志以及Struts2配置异常处理方法
- poj 1258 prim
- ios push(python编程)
- Failed build maven-gpg-plugin in openstack-java-sdk
- android笔记 - 网络状态判断
- 大型网站技术架构
- 解决infobright 的group by 因为NULL值,会出现两条一样的结果的问题
- myeclipse关联hibernate源码
- 【POJ】【P3422】【Kaka's Matrix Travels】【题解】
- Linux环境下安装JDK1.6
- IIS7下ajax报未定义错误
- zend_Application 的几个作用