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
Sample Output
4
2
大意:
A是B的朋友,B是C的朋友,那么A也是C的朋友,求最大的朋友圈子内朋友的数量
思路:
采用并查集,最后找出最大的朋友圈,具体细节见代码
AC代码:
#include <bits/stdc++.h>
#define mem(a,n) memset(a,n,sizeof(a))
#define rd1(x) scanf("%d",&x)
#define rd2(x,y) scanf("%d%d",&x,&y)
#define prt(x) printf("%d\n",x)
using namespace std;
int f[10000005],cnt[10000005];
int find(int x)
{
if(f[x]==x) return x;
return f[x]=find(f[x]);//这一步有利于减少之后的查询时间
}
void Merge(int a,int b)
{
int fa=find(a),fb=find(b);
if(fa!=fb)
{
f[fa]=fb;
//两个集合合并,将一个集合的人数加到另一个集合上
cnt[fb]+=cnt[fa];
}
}
int main()
{
int n,a,b,ans;
while(cin>>n)
{
for(int i=1;i<=10000000;i++) {f[i]=i;cnt[i]=1;}
ans=1;
while(n--)
{
rd2(a,b);
Merge(a,b);
}
for(int i=1;i<=10000000;i++)
{
if(f[i]==i)
if(cnt[i]>ans) ans=cnt[i];
}
prt(ans);
}
return 0;
}