HDU1856More is better
来源:互联网 发布:2017淘宝开店认证手机 编辑:程序博客网 时间:2024/06/14 23:23
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
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
题意
题解:
问一个根结点最多绑定几个节点 0输出1
AC代码
#include<cstdio>#include<cstring>#include<stack>#include <set>#include <queue>#include <vector>#include<iostream>#include<algorithm>using namespace std;typedef long long LL;const int mod = 1e9+7;int par[10000005];int rnk[10000005];int n;int ans;void init(){ for (int i = 1;i <= 10000005; ++i){ par[i] = i; rnk[i] = 1; }}int fd(int x){ if (x == par[x]) return x; return par[x]=fd(par[x]);}void ut(int x,int y){ int tx = fd(x); int ty = fd(y); if (tx!=ty){ par[tx] = ty; rnk[ty]+=rnk[tx]; ans = max(ans,rnk[ty]); }}int main(){ int n; while (scanf("%d",&n)!=EOF){ init(); if (n==0) { printf("1\n"); continue; } ans = 0; int x,y; while (n--){ scanf("%d%d",&x,&y); ut(x,y); } printf("%d\n",ans); } return 0;}
- hdu1856More is better
- hdu1856More is better
- HDU1856More is better
- hdu1856More is better 并查集基础
- hdu1856More is better【并差集】
- hdu1856More is better基础并查集
- 【并查集】HDU1856More is better
- HDU1856More is better(并查集)
- English is better and better
- HDOJ More is better
- HDU2929:Bigger is Better
- Worse is Better
- hdu More is better
- HDOJ1856More is better
- More is better
- HDU1856:More is better
- HDU1856--More is better
- hdu1856-More is better
- 大数定律1
- Eclipse常用快捷键
- Redis启动失败 服务端配置——Could not connect to Redis at 127.0.0.1:6379: Connection refused
- nyoj 117 求逆序数【树状数组】
- p2p 信令服务器作用细节
- HDU1856More is better
- 动画概述 一,创建一个简单的属性动画
- 8.3 C
- POJ 1861 最小生成树最大的边及记录
- Info 746:* is not made in the presence of a prototype
- Docker容器的自动化监控实现
- adb logcat 指北
- [Leetcode] 334. Increasing Triplet Subsequence 解题报告
- CodeForces