hdoj1856
来源:互联网 发布:淘宝神笔保存后找不到 编辑:程序博客网 时间:2024/04/28 02:10
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.
题意:有10000000个人去参加选拔,在最后留下的人中,要求每两个人之间有直接或间接联系,问最多能留下多少人,n表示有几对有直接联系的人。
代码如下:
#include<stdio.h>#include<string.h>int par[10010000],num[10010000];int max;int find(int x){if(x==par[x])return x;else return par[x]=find(par[x]);}void unite(int x,int y){int fx=find(x);int fy=find(y);if(fx!=fy){par[fx]=fy;num[fy]+=num[fx];if(max<num[fy])max=num[fy];} }int main(){int n,u,v;while(scanf("%d",&n)!=EOF){int i,j;max=1;for(i=0;i<10010000;i++){par[i]=i;num[i]=1;}for(i=0;i<n;i++){scanf("%d%d",&u,&v);unite(u,v);} printf("%d\n",max);}}
0 0
- hdoj1856
- More is better<hdoj1856>
- HDOJ1856 并查集水题
- HDOJ1856 More is better 【并查集】
- 并查集 HDOJ1856 More is better
- hdoj1856 More is better(并查集)
- 子树包含了多少个节点(并查集)——czy的工程VS hdoj1856 More is better
- JAVA三大特性
- Windows下Memcache的安装及PHP扩展配置方法
- 全局拦截器
- 同名cpp文件导致先生成的obj文件被后生成的obj覆盖-导致link error
- 【学习】十分钟搞清字符集和字符编码
- hdoj1856
- windows程序设计 绘图模式--SetROP2
- 嵌入式学习-驱动开发-lesson5-总线设备驱动模型及平台总线驱动
- elaserch 查看节点是否是master
- POI的简单使用
- 算法-尺取法
- Android Studio相见恨晚的操作锦集
- struts中使用json返回参数
- hdu 1733 Escape(分层最大流)