import java.util.*; public class Main { static Scanner sc = new Scanner(System.in); static public int N = sc.nextInt(); static public int M = sc.nextInt(); static public int max = 0; public static void main(String[] args) { int[][] arr = new int[N][M]; for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { arr[i][j] = sc.nextInt(); } } longV1(arr); longV2(arr); square(arr); kiukV1(arr); kiukV2(arr); kiukV3(arr); kiukV4(arr); kiukV5(arr); kiukV6(arr); kiukV7(arr); kiukV8(arr); riulV1(arr); riulV2(arr); riulV3(arr); riulV4(arr); fuckV1(arr); fuckV2(arr); fuckV3(arr); fuckV4(arr); System.out.println(max); } //가로로 4칸 public static void longV1(int[][] arr) { for (int i = 0; i < N; i++) { for (int j = 0; j <= M - 4; j++) { int num = 0; num += arr[i][j] + arr[i][j + 1] + arr[i][j + 2] + arr[i][j + 3]; if (num > max) { max = num; } } } } //세로로 4칸 public static void longV2(int[][] arr) { for (int i = 0; i <= N - 4; i++) { for (int j = 0; j < M; j++) { int num = 0; num += arr[i][j] + arr[i + 1][j] + arr[i + 2][j] + arr[i + 3][j]; if (num > max) { max = num; } } } } //정사각형 public static void square(int[][] arr) { for (int i = 0; i <= N - 2; i++) { for (int j = 0; j <= M - 2; j++) { int num = 0; num += arr[i][j] + arr[i + 1][j] + arr[i][j + 1] + arr[i + 1][j + 1]; if (num > max) { max = num; } } } } //ㄱ v1 public static void kiukV1(int[][] arr) { for (int i = 2; i < N; i++) { for (int j = 0; j <= M - 2; j++) { int num = 0; num += arr[i][j] + arr[i - 1][j] + arr[i - 2][j] + arr[i][j + 1]; if (num > max) { max = num; } } } } //ㄱ v2 public static void kiukV2(int[][] arr) { for (int i = 1; i < N; i++) { for (int j = 2; j < M; j++) { int num = 0; num += arr[i][j] + arr[i][j - 1] + arr[i][j - 2] + arr[i - 1][j - 2]; if (num > max) { max = num; } } } } //ㄱ v3 public static void kiukV3(int[][] arr) { for (int i = 0; i <= N - 3; i++) { for (int j = 1; j < M; j++) { int num = 0; num += arr[i][j] + arr[i][j - 1] + arr[i + 1][j] + arr[i + 2][j]; if (num > max) { max = num; } } } } //ㄱ v4 public static void kiukV4(int[][] arr) { for (int i = 0; i <= N - 2; i++) { for (int j = 0; j <= M - 3; j++) { int num = 0; num += arr[i][j] + arr[i + 1][j] + arr[i][j + 1] + arr[i][j + 2]; if (num > max) { max = num; } } } } //ㄱ v5 public static void kiukV5(int[][] arr) { for (int i = 2; i < N; i++) { for (int j = 1; j < M; j++) { int num = 0; num += arr[i][j] + arr[i - 1][j] + arr[i - 2][j] + arr[i][j - 1]; if (num > max) { max = num; } } } } //ㄱ v6 public static void kiukV6(int[][] arr) { for (int i = 1; i < N; i++) { for (int j = 0; j <= M - 3; j++) { int num = 0; num += arr[i][j] + arr[i - 1][j] + arr[i][j + 1] + arr[i][j + 2]; if (num > max) { max = num; } } } } //ㄱ v7 public static void kiukV7(int[][] arr) { for (int i = 0; i <= N - 3; i++) { for (int j = 0; j <= M - 2; j++) { int num = 0; num += arr[i][j] + arr[i][j + 1] + arr[i + 1][j] + arr[i + 2][j]; if (num > max) { max = num; } } } } //ㄱ v8 public static void kiukV8(int[][] arr) { for (int i = 0; i <= N - 2; i++) { for (int j = 2; j max) { max = num; } } } } //ㄹ v1 public static void riulV1(int[][] arr) { for (int i = 0; i <= N - 3; i++) { for (int j = 0; j <= M - 2; j++) { int num = 0; num += arr[i][j] + arr[i + 1][j] + arr[i + 1][j + 1] + arr[i + 2][j + 1]; if (num > max) { max = num; } } } } public static void riulV2(int[][] arr) { for (int i = 1; i < N; i++) { for (int j = 0; j <= M - 3; j++) { int num = 0; num += arr[i][j] + arr[i][j + 1] + arr[i - 1][j + 1] + arr[i - 1][j + 2]; if (num > max) { max = num; } } } } public static void riulV3(int[][] arr) { for (int i = 0; i <= N - 3; i++) { for (int j = 1; j < M; j++) { int num = 0; num += arr[i][j] + arr[i + 1][j] + arr[i + 1][j - 1] + arr[i + 2][j - 1]; if (num > max) { max = num; } } } } public static void riulV4(int[][] arr) { for (int i = 0; i <= N - 2; i++) { for (int j = 0; j <= M - 3; j++) { int num = 0; num += arr[i][j] + arr[i][j + 1] + arr[i + 1][j + 1] + arr[i + 1][j + 2]; if (num > max) { max = num; } } } } public static void fuckV1(int[][] arr) { for (int i = 1; i < N; i++) { for (int j = 1; j <= M - 2; j++) { int num = 0; num += arr[i][j] + arr[i][j - 1] + arr[i - 1][j] + arr[i][j + 1]; if (num > max) { max = num; } } } } public static void fuckV2(int[][] arr) { for(int i=1; i<=N-2; i++) { for (int j = 1; j < M; j++) { int num = 0; num += arr[i][j] + arr[i][j - 1] + arr[i - 1][j] + arr[i + 1][j]; if (num > max) { max = num; } } } } public static void fuckV3(int[][] arr) { for (int i = 0; i <= N - 2; i++) { for (int j = 1; j < M - 2; j++) { int num = 0; num += arr[i][j] + arr[i][j - 1] + arr[i + 1][j] + arr[i][j + 1]; if (num > max) { max = num; } } } } public static void fuckV4(int[][] arr) { for (int i = 1; i <= N - 2; i++) { for (int j = 0; j <= M - 2; j++) { int num = 0; num += arr[i][j] + arr[i - 1][j] + arr[i][j + 1] + arr[i + 1][j]; if (num > max) { max = num; } } } } }

제출 #83955

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: