HDU 1856
来源:互联网 发布:预谋邂逅知乎 编辑:程序博客网 时间:2024/05/17 07:27
More is better
Time Limit: 1000MS Memory Limit: 102400KB 64bit IO Format: %I64d & %I64u
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
42
思路:基础并查集。
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn = 10240000;int num[maxn];int f[maxn];int Find(int x){ return x == f[x]?x:f[x] = Find(f[x]);}void Union(int x,int y){ int xx = Find(x); int yy = Find(y); if(xx != yy) { f[xx] = yy; num[yy]+=num[xx]; }}int main(){ int n; while(scanf("%d",&n)!=EOF) { for(int i = 0;i <= 10000000;i++) { f[i] = i; num[i] = 1; } for(int i = 0;i < n;i++) { int x,y; scanf("%d%d",&x,&y); Union(x,y); } int maxx = 0; for(int i = 0;i <= 10000000;i++) { maxx = max(maxx,num[i]); } printf("%d\n",maxx); } return 0;}
0 0
- HDU 1856
- HDU 1856
- HDU 1856
- hdu 1856
- hdu 1856
- HDU 1856
- hdu 1856
- hdu 1856
- HDU 1856
- hdu 1856
- hdu 1856
- hdu 1856
- hdu-1856
- hdu 1856
- hdu 1856
- hdu 1856
- hdu--1856
- HDU 1856
- Bestcoder_Dertouzos
- Java enum的用法详解
- C++-glog/gflags/protobuf
- JAVA中怎么保留小数点后两位
- 静态方法、实例方法和域
- HDU 1856
- 使用再生龙制作linux系统镜像及还原
- viterbi,维特比算法通俗理解
- solr出现以下异常信息
- USACO 2007 Dec Silver Mud Puddles bfs or A-star
- hdu 5743 Join The Future
- 项目配置和git仓库设置
- 【HNOI2002】bzoj1010 玩具装箱
- JS学习