More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)
Total Submission(s): 18900 Accepted Submission(s): 6951
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
4 1 2 3 4 5 6 1 6 4 1 2 3 4 5 6 7 8
Sample Output
4 2
//之所以写这道题是因为,今天的测试有类似的题目,思路方法明明相同,可是我却怎么想都没有想出来怎么做的,明明做过,却没有做出来,需要思考啊
#include<cstdio>
#define MAX 100010
int per[MAX];
int pin[MAX];//记录节点数
int max;
int find(int x)
{
int t=x;
while (t!=per[t])
t=per[t];
int i,j;
i = x;
while(i != t)
{
j = per[i];
per[i] = t;
i = j;
}
return t;
}
void un(int x,int y)
{
int x1=find(x);
int y1=find(y);
if (x1!=y1)
{
per[x1]=y1;
pin[y1]+=pin[x1];
if (pin[y1]>max)//主要精华,主要的一点,就差这一点
max=pin[y1];
}
}
int main()
{
int n;
while (scanf ("%d",&n)!=EOF)
{
if (n==0)
{
printf ("1\n");
continue;
}
for (int i=1;i<=100000;i++)
{
per[i]=i;
pin[i]=1;
}
//per[i]==1;
int a,b;
max=1;
while (n--)
{
scanf ("%d%d",&a,&b);
un(a,b);
}
printf ("%d\n",max);
//printf ("%d\n",lwq);
}
return 0;
}