HDU 1856 并查集
来源:互联网 发布:社工数据库 编辑:程序博客网 时间:2024/05/01 09:27
More is better
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 <iostream>using namespace std;const int Max=11111111;int maxn;int p[Max];int f[Max];int find(int x){ if(x!=p[x]) p[x]=find(p[x]); return p[x];}void merge(int x,int y){ x=find(x); y=find(y); if(x!=y) p[x]=y,f[y]+=f[x]; if(maxn<f[y]) maxn=f[y];}int main(){ int n,i,a,b; while(~scanf("%d",&n)) { for(i=1;i<=10000000;i++) p[i]=i,f[i]=1; maxn=1; while(n--) { scanf("%d%d",&a,&b); merge(a,b); } printf("%d\n",maxn); } return 0;}
- HDU 1856 并查集
- hdu 1856(并查集)
- hdu 1856 并查集
- HDU-1856,并查集
- HDU 1856 并查集
- hdu 1856 并查集
- HDU 1856 并查集
- 并查集 HDU 1856
- hdu 1856并查集
- HDU 1856 并查集
- hdu 1856(并查集)
- hdu 1232 .hdu 1856 并查集 。。。
- HDU 1856(并查集)
- HDU 1856 并查集+离散化
- HDU 1856 简单并查集
- 并查集 hdu 1856 示例
- 并查集 hdu 1856 示例
- hdu 1856 离散化+并查集
- 二叉排序树的简单实现
- cocos2d-x在android下添加多盟插屏广告
- PMt表分析
- Leap Motion架构
- 木兰围场
- HDU 1856 并查集
- C语言新体会
- 2013 多校第七场 hdu 4667 Building Fence(计算几何、凸包)
- MongoDB 应用点滴
- c++面向对象编程的一个例子(书店)
- non-numeric second argument to `wordlist' function
- 树莓派Raspberry Pi搭建Hadoop集群
- 关于”点九” PNG的一种
- 大话设计模式之命令模式