More is better

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 327680/102400 K (Java/Others)
Total Submission(s): 25168    Accepted Submission(s): 9045

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

Hint

A and B are friends(direct or indirect), B and C are friends(direct or indirect),
then A and C are also friends(indirect).

In the first sample {1,2,5,6} is the result.
In the second sample {1,2},{3,4},{5,6},{7,8} are four kinds of answers.

Author

[email protected]

Source

HDU 2007 Programming Contest - Final

这道题目需要统计并查集的秩

只需要加一个数组记录根节点的秩, 然后在合并时, 顺带着将秩也合并即可

 1 #include <cstdio>
 2 #include <cstdlib>
 3 #include <climits>
 4
 5 const int MAX = 10000005;
 6 int pre[MAX],rank[MAX],maxx;
 7
 8
 9 void init(){
10     int i;
11     for(i=1;i<MAX;++i){
12         pre[i] = i;
13         rank[i] = 1;
14     }
15 }
16
17 int root(int x){
18     if(x!=pre[x]){
19         pre[x] = root(pre[x]);
20     }
21     return pre[x];
22 }
23
24 void merge(int x,int y){
25     int fx = root(x);
26     int fy = root(y);
27     if(fx!=fy){
28         pre[fx] = fy;
29         rank[fy] += rank[fx];//更改对应元素的秩
30         if(rank[fy]>maxx)maxx = rank[fy];//更新最大值
31     }
32 }
33
34
35 int main(){
36     //freopen("in.txt","r",stdin);
37     int i,n,x,y;
38     while(scanf("%d",&n)!=EOF){
39         if(n==0){
40             printf("1\n");
41             continue;
42         }
43         init();
44         maxx = INT_MIN;
45         for(i=0;i<n;++i){
46             scanf("%d %d",&x,&y);
47             merge(x,y);
48         }
49         printf("%d\n",maxx);
50     }
51     return 0;
52 }