hdu1856 More is better （并查集）

hdu1856 More is better （并查集）

More is better

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 327680/102400 K (Java/Others) Total Submission(s): 19011    Accepted Submission(s): 6998

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.

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

4 1 2 3 4 5 6 1 6 4 1 2 3 4 5 6 7 8

Sample Output

Hint

Author

lxlcrystal@TJU

Source

​​HDU 2007 Programming Contest - Final​​

Recommend

lcy   |   We have carefully selected several similar problems for you:   ​​1102​​​  ​​​1198​​​  ​​​1162​​​  ​​​1301​​​  ​​​1829​​

​​Statistic​​ |

​​Submit​​ |

​​Discuss​​ |

​​Note​​

一个并查集 计算每个集合的元素 找出元素最多的那个集合，输出元素的个数

输入n=0时也应该输出1

难点就在于，怎么计算集合的元素个数。。其实只要在初始的时候每个元素都初始为1，

然后合并集合的时候+1就好了

#include #include #define N 10000000+5int fa[N],stamp[N];int find(int x){ if(fa[x]!=x) fa[x]=find(fa[x]); return fa[x];}void init(){ for(int i=1;i<=N;i++) fa[i]=i,stamp[i]=1;}int main(){ int n,min,max; while(~scanf("%d",&n)) { init(); min=10000000+5,max=-1; for(int i=0;imax) max=a; if(b>max) max=b; if(acount) count=stamp[i]; } printf("%d\n",count); } return 0;}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。