hdoj 1856 More is better 【并查集 求最大节点数】
2015-03-16 13:08
316 查看
More is better
[b]Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 16707 Accepted Submission(s): 6152
[/b]
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
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.
并查集:求所有树中最多的节点数。
#include<stdio.h> #include<string.h> #define max 10000000+10 int 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; }
相关文章推荐
- hdoj 1856 More is better 【并查集 求最大节点数】
- 子树包含了多少个节点(并查集)——czy的工程VS hdoj1856 More is better
- HDOJ 1856 More is better(并查集)
- HDOJ 1856 More is better (并查集 + 压缩路径 + 结点深度)
- hdoj problem 1856 More is better(并查集||动态规划)
- hdoj 1856 More is better(并查集)
- HDU1856 - More is better 利用并查集找最大群体数目
- hdoj 1856 More is better 【并查集】
- hdoj 1856 More is better【求树的节点数】
- hdoj1856 More is better(并查集)
- hdoj-1856-More is better【并查集】
- HDU 1856 More is better(简单并查集) 【最大并查集人数模板】
- HDOJ-1856 More is better&&POJ-1611(并查集)
- HDOJ1856 More is better 【并查集】
- hdu 1856 More is better 并查集找最大集合
- HDOJ 1856 More is better (并查集)
- HDOJ 1856 More is better (并查集)
- hdoj-1856-More is better【并查集】
- HDOJ 1856 More is better (带权并查集)
- hdu 1856 More is better (并查集)