HDU 1856 more is better

More is better Time Limit: 5000/1000 MS (Java/others) memory limit: 327680/102400 K (Java/Others)
Total submission (s): 14656 accepted submission (s): 5390

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 shoshould be friends (direct or indirect), or there is only one boy left. given all the direct friend-pairs, you shoshould decide the best way.

Input

The first line of the input contains an integer N (0 ≤ n ≤0 ≤ 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
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.

 

Returns the number of elements in the maximum set.

Idea: Initialize the CNT of each set to 1, merge CNT during the merge process, and update the maximum CNT

In another way, P is initialized to-1, and find_set determines whether it is-1. If yes, it indicates it is the root node.

#include<cstring>#include<iostream>#include<string>#include<algorithm>using namespace std;const int maxn=10000000+5;int p[maxn], cnt[maxn], max_cnt;void make_set(){    memset(p, -1, sizeof(p));    for(int i=0;i<maxn;i++) cnt[i]=1;    max_cnt=1;}int find_set(int x){    return p[x]==-1 ? x : p[x]=find_set(p[x]);    //return p[x]==x ? x : p[x]=find_set(p[x]);}void union_set(int x, int y){    int fx=find_set(x), fy=find_set(y);    if(fx==fy) return;    p[fx]=fy;    cnt[fy]+=cnt[fx];    max_cnt=max(max_cnt, cnt[fy]);}int main(){    int n, x, y;    while(scanf("%d", &n)!=EOF) {        make_set();        for(int i=0;i<n;i++)        {            scanf("%d%d", &x, &y); union_set(x, y);        }        printf("%d\n", max_cnt);    }    return 0;}