HDU-1856-More is better
来源:互联网 发布:jquery.base64.js用法 编辑:程序博客网 时间:2024/06/14 11:49
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 22455 Accepted Submission(s): 8172
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题意:告诉你一堆人里面4种朋友关系,但若A认识B,B认识C,那么A也认识C,求一个朋友圈里面最多的朋友数量题目链接:More is better解题思路:并查集的基本操作,但要将每个并查集优化,即每个点的父节点都指向根,这样保证一个树的高度就是他所含的朋友数,方便计算合并后的朋友数,此处值得思考的地方就是两个树的高度和就是合并后树的高度。数据结构有时好依赖模板啊~代码:
0 0
- hdu 1856 More is better
- HDU 1856 more is better
- Hdu-1856 More is better
- hdu 1856 More is better
- hdu 1856 More is better
- hdu 1856 More is better
- HDU 1856 More is better
- HDU 1856 More is better
- HDU 1856 More is better
- HDU 1856 More is better
- hdu 1856 More is better
- hdu 1856 More is better
- HDU 1856 More is better
- hdu 1856 More is better
- hdu 1856 More is better
- HDU 1856 More is better
- hdu 1856 More is better
- hdu-1856 More is better
- 百度联盟发现作弊行为的分析以及应对作弊行为的措施
- 8种Nosql数据库系统对比
- Spring基础知识之IOC(控制反转)
- HDU 5696 区间的价值 (百度之星2B)
- 欢迎使用CSDN-markdown编辑器
- HDU-1856-More is better
- Plist存储简述
- SpringFramework的几个核心模块
- Leetcode 350. Intersection of Two Arrays II
- 框架 day37 Spring3,AOP,代理模式(动态/CGLIB/工厂bean),传统AOP,AspectJ框架(基于xml/注解),切入点表达式,jdbcTemplate
- 理解 Java 垃圾回收机制
- 食物链
- hdu 4114 状压dp floyd
- 第八周项目:指向学生类的指针