Submission #171145

---

Source Code Expand

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int M = sc.nextInt();
		boolean[][] relation = new boolean[N][N];
		for (int i=0; i<N; i++) {
			for (int j=0; j<N; j++) {
				relation[i][j] = i==j?true:false;
			}
		}
		//
		for (int i=0; i<M; i++) {
			int x = sc.nextInt();
			int y = sc.nextInt();
			relation[x-1][y-1] = true;
			relation[y-1][x-1] = true;
		}
		//
		int max=1;
		for (int y=0; y<N; y++) {
			if (N-y<max) break;
			for (int x=0; x<N; x++) {
				if (N-x<max) break;
				int xLen=0;
				for (int i=x; i<N; i++) {
					if(relation[y][i]) xLen++;
					else break;
				}
				if (xLen<=max) continue;
				for (int j=1; j<xLen; j++) {
					int xLen0=0;
					for (int i=0; i<xLen; i++) {
						if (relation[y+j][x+i]) xLen0++;
						else break;
					}
					if (xLen0<=j+1) {
						max = xLen0;
						break;
					}
				}
			}
		}
		//
		System.out.println(max);
		sc.close();
	}
}

Submission Info

Judge Result