hdoj 1856 More is better 【并查集 求最大节点数】
来源:互联网 发布:下载基金软件 编辑:程序博客网 时间:2024/06/05 20:52
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)
Total Submission(s): 16707 Accepted Submission(s): 6152
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
42HintA 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.
并查集:求所有树中最多的节点数。
#include<stdio.h>#include<string.h>#define max 10000000+10int set[max],path[max];int sum=0;int find(int p){ int child=p; int t; while(p!=set[p]) p=set[p]; while(child!=p) { t=set[child]; set[child]=p; child=t; } return p;}void merge(int x,int y){ int fx=find(x); int fy=find(y); if(fx!=fy) { set[fx]=fy; path[fy]+=path[fx];//这里不需要判断大小 if(sum<path[fy])//求最多的节点 sum=path[fy]; }}int main(){ int n,i,j,x,y; while(scanf("%d",&n)!=EOF) { if(n==0) { printf("1\n"); continue;//注意!!! } for(i=1;i<max;i++) { set[i]=i; path[i]=1; } while(n--) { scanf("%d%d",&x,&y); merge(x,y); } printf("%d\n",sum); sum=0; } return 0;}
0 0
- hdoj 1856 More is better 【并查集 求最大节点数】
- hdoj 1856 More is better 【并查集 求最大节点数】
- HDOJ 1856 More is better(并查集,记录树的节点数)
- HDOJ 1856 More is better【并查集】(求一个集合中节点的总个数)
- HDOJ--1856--More is better【并查集】
- HDOJ 题目1856More is better(并查集)
- hdoj-1856-More is better【并查集】
- HDOJ 1856 More is better (并查集)
- hdoj 1856 More is better [并查集]
- hdoj 1856 More is better 【并查集】
- hdoj 1856 More is better(并查集)
- HDOJ 1856 More is better (并查集)
- HDOJ-1856 More is better&&POJ-1611(并查集)
- HDOJ 1856 More is better(并查集)
- HDOJ 1856 More is better (并查集)
- HDOJ 1856 More is better (带权并查集)
- hdoj 1856 more is better (如何记录节点数)
- (并查集)More is better--HDOJ
- 一个sha1在线加密脚本源码
- java批量下载
- Python2.7升级Python3.3步骤详解
- 数据结构--AVL树的insert()的Java实现
- [GDUT-ACM]-2
- hdoj 1856 More is better 【并查集 求最大节点数】
- 这是我的第一个博客
- 有关跑步和读书,随意落笔
- python学习笔记-(9)再识python面向对象
- Android Studio failed to create jvm error code -4
- 扩展欧几里德
- Gradle编译优化,导致Resources$NotFoundException
- 链表逆序,单向链表
- 图像处理ORB特征学习笔记(1)