Problem:
Score : 400 points

Problem Statement

There are N persons called Person 1 through Person N.

You are given M facts that "Person A_i and Person B_i are friends." The same fact may be given multiple times.

If X and Y are friends, and Y and Z are friends, then X and Z are also friends. There is no friendship that cannot be derived from the M given facts.

Takahashi the evil wants to divide the N persons into some number of groups so that every person has no friend in his/her group.

At least how many groups does he need to make?

Constraints

2 \leq N \leq 2\times 10^5

0 \leq M \leq 2\times 10^5

1\leq A_i,B_i\leq N

A_i \neq B_i

Input

Input is given from Standard Input in the following format:

N M
A_1 B_1
\vdots
A_M B_M

Output

Print the answer.

Sample Input 1

5 3
1 2
3 4
5 1

Sample Output 1

3

Dividing them into three groups such as \{1,3\}, \{2,4\}, and \{5\} achieves the goal.

Sample Input 2

4 10
1 2
2 1
1 2
2 1
1 2
1 3
1 4
2 3
2 4
3 4

Sample Output 2

4

Sample Input 3

10 4
3 1
4 1
5 9
2 6

Sample Output 3

3

Solution in Java (OpenJDK 11.0.6) (judge verdict: Wrong Answer)

import java.util.ArrayList;
import java.util.Scanner;

public class Main {
	static int N,M;
	static boolean[]visited;
	static int minElem = Integer.MAX_VALUE;
	static ArrayList<ArrayList<Integer>> adjList = new ArrayList<ArrayList<Integer>>();
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		 N = sc.nextInt();
		 M = sc.nextInt();
		 visited = new boolean[N+1];
		 //System.out.println(" N "+ N+ " M "+M);
		 for(int i = 0 ; i <= N; i++) {
			adjList.add(new ArrayList<Integer>());
		 }
		 int src, dest;
		for(int i = 0 ; i < M; i++) {
			src = sc.nextInt();
			dest = sc.nextInt();
			adjList.get(src).add(dest);
			adjList.get(dest).add(src);
		}
		//System.out.println("visited size "+visited.length);
		int []compElements = new int[N+1];
		int cc = 0;
		for(int i = 1; i <= N; i++) {
			if(visited[i] ==  false) {
				 int cce = dfs(i, adjList); 
				 //System.out.println("cce  for "+i+ " "+cce);
				 if(cce != 1) {
					 compElements[cc++] = cce;
					 minElem = Math.min(minElem, cce);
				 }	
			}
		}
		//System.out.println("minElem "+minElem);
		int res = 0;
		if (minElem != Integer.MAX_VALUE) {
			res = minElem;
			for(int i = 0 ; i < cc; i++ ) 
				res = res + compElements[i] - minElem;
		} 
			System.out.println(res);		
	}
	
	public static int dfs(int vertex, ArrayList<ArrayList<Integer>> adjList) {
		visited[vertex] = true;
		ArrayList<Integer> adjVs = adjList.get(vertex);
		int res = 1;
		for(int i = 0 ; i < adjVs.size(); i++) {
			int a = adjVs.get(i);
			if(visited[a] == false) {
				res = res + dfs(a, adjList);
			}
		}
		return res;
	}
}