题目1444：More is better

题目1444：More is better

时间限制：3 秒

内存限制：100 兆

特殊判题：否

提交：1241

解决：577

题目描述：

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.

输入：

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)

输出：

The output in one line contains exactly one integer equals to the maximum number of boys Mr Wang may keep.

样例输入：

41 23 45 61 641 23 45 67 8

样例输出：

42

import java.util.Arrays;import java.util.Scanner; public class Main{     static int Tree[] = new int[10000001];    static int Sum[] = new int[10000001];    public static void main(String[] args) {        Scanner scanner = new Scanner(System.in);                 while( scanner.hasNext() ){            int n = scanner.nextInt();            Arrays.fill(Tree, -1);            Arrays.fill(Sum, 1);                                      while(n-- != 0){                int a = scanner.nextInt();                int b = scanner.nextInt();                                 a = findRoot(a);                b = findRoot(b);                                 if(a != b){                    Tree[a] = b;                    Sum[b] += Sum[a];                }                             }                         int ans = 1;            for (int i = 0; i < Sum.length; i++) {                if(Tree[i] == -1 && Sum[i] > ans) ans = Sum[i];            }                         System.out.println(ans);        }    }         public static int findRoot(int x){        if(Tree[x] == -1) return x;        else{            int tmp = findRoot(Tree[x]);            Tree[x] = tmp;            return tmp;        }    } } /**************************************************************    Problem: 1444    User: yihukurama    Language: Java    Result: Accepted    Time:2630 ms    Memory:257500 kb****************************************************************/