import java.util.*; import java.io.*; public class Main { static int N, M; static int[][] numbers; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); String[] nm = br.readLine().split(" "); N = Integer.parseInt(nm[0]); M = Integer.parseInt(nm[1]); numbers = new int[N][M]; for (int i = 0; i < N; i++) { String[] s = br.readLine().split(" "); for (int j = 0; j < M; j++) { numbers[i][j] = Integer.parseInt(s[j]); } } int[] x1 = { 0, 0, 0, 0 }; int[] y1 = { 0, 1, 2, 3 }; int[] x1Rotate = { 0, 1, 2, 3 }; int[] y1Rotate = { 0, 0, 0, 0 }; int[] x2 = { 0, 0, 1, 1 }; int[] y2 = { 0, 1, 0, 1 }; int[] x3 = { 0, 1, 2, 2 }; int[] y3 = { 0, 0, 0, 1 }; int[] x3Rotate1 = { 0, 0, 0, 1 }; int[] y3Rotate1 = { 0, 1, 2, 0 }; int[] x3Rotate2 = { 0, 0, 1, 1 }; int[] y3Rotate2 = { 0, 1, 1, 1 }; int[] x3Rotate3 = { 0, 1, 1, 1 }; int[] y3Rotate3 = { 0, 0, -1, -2 }; int[] x3Reverse1 = { 0, 1, 2, 0 }; int[] y3Reverse1 = { 0, 0, 0, 1 }; int[] x3Reverse2 = { 0, 1, 1, 1 }; int[] y3Reverse2 = { 0, 0, 1, 2 }; int[] x3Reverse3 = { 0, 1, 2, 0 }; int[] y3Reverse3 = { 0, 0, 0, 1 }; int[] x3Reverse4 = { 0, 1, 1, 1 }; int[] y3Reverse4 = { 0, 0, 1, 2 }; int[] x4 = { 0, 1, 1, 2 }; int[] y4 = { 0, 0, 1, 1 }; int[] x4Rotate1 = { 0, 0, 1, 1 }; int[] y4Rotate1 = { 0, -1, -1, -2 }; int[] x4Reverse1 = { 0, 1, 1, 2 }; int[] y4Reverse1 = { 0, 0, 1, 1 }; int[] x4Reverse2 = { 0, 0, 1, 1 }; int[] y4Reverse2 = { 0, 1, 1, 2 }; int[] x5 = { 0, 0, 0, 1 }; int[] y5 = { 0, 1, 2, 1 }; int[] x5Rotate1 = { 0, -1, 0, 1 }; int[] y5Rotate1 = { 0, 1, 1, 1 }; int[] x5Rotate2 = { 0, 0, 1, 0 }; int[] y5Rotate2 = { 0, -1, 0, 1 }; int[] x5Rotate3 = { 0, 1, 2, 1 }; int[] y5Rotate3 = { 0, 0, 0, 1 }; int max = -1; for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { int[] result = new int[19]; int cx = i; int cy = j; for (int k = 0; k < 4; k++) { boolean isPossible = true; int mx = cx + x1[k]; int my = cy + y1[k]; if (!(mx >= 0 && my >= 0 && mx < N && my < M)) { isPossible = false; } else { if (isPossible) { result[0] += numbers[mx][my]; } } } for (int k = 0; k < 4; k++) { int mx = cx + x2[k]; int my = cy + y2[k]; boolean isPossible = true; if (mx >= 0 && my >= 0 && mx < N && my < M) { result[1] += numbers[mx][my]; } } for (int k = 0; k < 4; k++) { int mx = cx + x3[k]; int my = cy + y3[k]; boolean isPossible = true; if (!(mx >= 0 && my >= 0 && mx < N && my < M)) { isPossible = false; } else { if (isPossible) { result[2] += numbers[mx][my]; } } } for (int k = 0; k < 4; k++) { int mx = cx + x4[k]; int my = cy + y4[k]; boolean isPossible = true; if (!(mx >= 0 && my >= 0 && mx < N && my < M)) { isPossible = false; } else { if (isPossible) { result[3] += numbers[mx][my]; } } } for (int k = 0; k < 4; k++) { int mx = cx + x5[k]; int my = cy + y5[k]; boolean isPossible = true; if (!(mx >= 0 && my >= 0 && mx < N && my < M)) { isPossible = false; } else { if (isPossible) { result[4] += numbers[mx][my]; } } } for (int k = 0; k < 4; k++) { int mx = cx + x1Rotate[k]; int my = cy + y1Rotate[k]; boolean isPossible = true; if (!(mx >= 0 && my >= 0 && mx < N && my < M)) { isPossible = false; } else { if (isPossible) { result[5] += numbers[mx][my]; } } } for (int k = 0; k < 4; k++) { int mx = cx + x3Rotate1[k]; int my = cy + y3Rotate1[k]; boolean isPossible = true; if (!(mx >= 0 && my >= 0 && mx < N && my < M)) { isPossible = false; } else { if (isPossible) { result[6] += numbers[mx][my]; } } } for (int k = 0; k < 4; k++) { int mx = cx + x3Rotate2[k]; int my = cy + y3Rotate2[k]; boolean isPossible = true; if (!(mx >= 0 && my >= 0 && mx < N && my < M)) { isPossible = false; } else { if (isPossible) { result[7] += numbers[mx][my]; } } } for (int k = 0; k < 4; k++) { int mx = cx + x3Rotate3[k]; int my = cy + y3Rotate3[k]; boolean isPossible = true; if (!(mx >= 0 && my >= 0 && mx < N && my < M)) { isPossible = false; } else { if (isPossible) { result[8] += numbers[mx][my]; } } } for (int k = 0; k < 4; k++) { int mx = cx + x3Reverse1[k]; int my = cy + y3Reverse1[k]; boolean isPossible = true; if (!(mx >= 0 && my >= 0 && mx < N && my < M)) { isPossible = false; } else { if (isPossible) { result[9] += numbers[mx][my]; } } } for (int k = 0; k < 4; k++) { int mx = cx + x3Reverse2[k]; int my = cy + y3Reverse2[k]; boolean isPossible = true; if (!(mx >= 0 && my >= 0 && mx < N && my < M)) { isPossible = false; } else { if (isPossible) { result[10] += numbers[mx][my]; } } } for (int k = 0; k < 4; k++) { int mx = cx + x3Reverse3[k]; int my = cy + y3Reverse3[k]; boolean isPossible = true; if (!(mx >= 0 && my >= 0 && mx < N && my < M)) { isPossible = false; } else { if (isPossible) { result[11] += numbers[mx][my]; } } } for (int k = 0; k < 4; k++) { int mx = cx + x3Reverse4[k]; int my = cy + y3Reverse4[k]; boolean isPossible = true; if (!(mx >= 0 && my >= 0 && mx < N && my < M)) { isPossible = false; } else { if (isPossible) { result[12] += numbers[mx][my]; } } } for (int k = 0; k < 4; k++) { int mx = cx + x4Rotate1[k]; int my = cy + y4Rotate1[k]; boolean isPossible = true; if (!(mx >= 0 && my >= 0 && mx < N && my < M)) { isPossible = false; } else { if (isPossible) { result[13] += numbers[mx][my]; } } } for (int k = 0; k < 4; k++) { int mx = cx + x4Reverse1[k]; int my = cy + y4Reverse1[k]; boolean isPossible = true; if (!(mx >= 0 && my >= 0 && mx < N && my < M)) { isPossible = false; } else { if (isPossible) { result[14] += numbers[mx][my]; } } } for (int k = 0; k < 4; k++) { int mx = cx + x4Reverse2[k]; int my = cy + y4Reverse2[k]; boolean isPossible = true; if (!(mx >= 0 && my >= 0 && mx < N && my < M)) { isPossible = false; } else { if (isPossible) { result[15] += numbers[mx][my]; } } } for (int k = 0; k < 4; k++) { int mx = cx + x5Rotate1[k]; int my = cy + y5Rotate1[k]; boolean isPossible = true; if (!(mx >= 0 && my >= 0 && mx < N && my < M)) { isPossible = false; } else { if (isPossible) { result[16] += numbers[mx][my]; } } } for (int k = 0; k < 4; k++) { int mx = cx + x5Rotate2[k]; int my = cy + y5Rotate2[k]; boolean isPossible = true; if (!(mx >= 0 && my >= 0 && mx < N && my < M)) { isPossible = false; } else { if (isPossible) { result[17] += numbers[mx][my]; } } } for (int k = 0; k < 4; k++) { int mx = cx + x5Rotate3[k]; int my = cy + y5Rotate3[k]; boolean isPossible = true; if (!(mx >= 0 && my >= 0 && mx < N && my < M)) { isPossible = false; } else { if (isPossible) { result[18] += numbers[mx][my]; } } } Arrays.sort(result); max = Math.max(max, result[18]); } } bw.write(max + "\n"); bw.flush(); bw.close(); br.close(); } }

제출 #25209

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: