hdu 1856 More is better (并查集)
来源:互联网 发布:电视直播软件哪个好 编辑:程序博客网 时间:2024/05/20 13:15
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
题意:给出n,接下来n行表示a,b之间连通,求出最大的联通块数量,注意n为0是输出1;
思路:用一个数组记录连通块的数量,在合并时也把数量记下;
代码:
#include<cstdio>#include<algorithm>#define maxn 10000005using namespace std;int a[maxn],vag[maxn];int maxz;int find(int t){ if(t!=a[t]) a[t]=find(a[t]); return a[t];}void mark(int x,int y){ int zx=find(x); int zy=find(y); if(zx==zy) return; if(vag[zx]<vag[zy]) { a[zx]=zy; vag[zy]+=vag[zx]; vag[zx]=0; if(maxz<vag[zy]) maxz=vag[zy]; } else { a[zy]=x; vag[zx]+=vag[zy]; vag[zy]=0; if(maxz<vag[zx]) maxz=vag[zx]; }}int main(){ int t; while(~scanf("%d",&t)) { int n,m; if(t==0) { printf("1\n"); continue; } maxz=0; for(int i=1;i<=maxn;i++) { a[i]=i; vag[i]=1; } for(int i=1;i<=t;i++) { int za,zb; scanf("%d%d",&za,&zb); mark(za,zb); } printf("%d\n",maxz); }}
- 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(并查集基础)
- 树莓派界面音频播放器 Qmmp
- 【Codeforces Round 362 (Div 2)E】【公式推导+快速幂+费马小定理】PLEASE a[i]=(1-a[i-1])除2下n次项 n为连乘数
- Criteria关联查询
- 关于微信公众号平台的“暂时无法提供服务”
- 字符串编辑距离
- hdu 1856 More is better (并查集)
- Android 调用系统方法调节音量
- LeetCode OJ-292. Nim Game
- 南阳OJ 333 mdd的烦恼 欧拉函数
- linux网络配置
- 网站流量突然下降应该怎么找原因?
- c++在调用类的时候不一定非得实例化对象哦,有时候你不写系统会为你默认生成一个临时实例对象哦~
- 【Codeforces Round 362 (Div 2)F】【AC自动机+矩阵快速幂】Legen... 长度为l字符串最大能够重复匹配的字符串权值
- Linux下生成.so文件