import java.util.*; import java.io.*; public class Main { static int[][] board; public static void main(String[] args) throws IOException{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st1 = new StringTokenizer(br.readLine()); int N = Integer.parseInt(st1.nextToken()); int M = Integer.parseInt(st1.nextToken()); board = new int[N][M]; for (int i = 0; i < N; i++){ StringTokenizer st2 = new StringTokenizer(br.readLine()); for (int j = 0; j < M; j++){ board[i][j] = Integer.parseInt(st2.nextToken()); } } int max = 0; for (int i = 0; i < N; i++){ for (int j = 0; j < M; j++){ if (i+3 < N){ int score = board[i][j]+board[i+1][j]+board[i+2][j]+board[i+3][j]; max = Math.max(max, score); } if (j+3 < M){ int score = board[i][j] + board[i][j+1] + board[i][j+2] + board[i][j+3]; max = Math.max(max, score); } if (i+1 < N && j+1 < M){ int score = board[i][j] + board[i + 1][j] + board[i][j+1] + board[i + 1][j+1]; max = Math.max(max, score); } if (i+2 < N && j+1 < M){ int score = board[i][j] + board[i + 1][j] + board[i + 2][j] + board[i + 2][j+1]; max = Math.max(max, score); score = board[i][j] + board[i+1][j] + board[i + 2][j] + board[i][j+1]; max = Math.max(max, score); score = board[i][j] + board[i + 1][j] + board[i + 1][j+1] + board[i + 2][j+1]; max = Math.max(max, score); score = board[i][j] + board[i + 1][j] + board[i + 2][j] + board[i + 1][j+1]; max = Math.max(max, score); } if (j+2 < M && i-1 >= 0){ int score = board[i][j] + board[i][j+1] + board[i][j+2] + board[i-1][j+2]; max = Math.max(max, score); score = board[i][j] + board[i][j+1] + board[i-1][j+1] + board[i-1][j+2]; max = Math.max(max, score); score = board[i][j] + board[i][j+1] + board[i][j+2] + board[i - 1][j+1]; max = Math.max(max, score); } if (j+2 < M && i+1 < N){ int score = board[i][j] + board[i][j+1] + board[i][j+2] + board[i+1][j+2]; max = Math.max(max, score); score = board[i][j] + board[i][j + 1] + board[i][j + 2] + board[i +1][j]; max = Math.max(max, score); score = board[i][j] + board[i+1][j] + board[i+1][j + 1] + board[i + 1][j+2]; max = Math.max(max, score); score = board[i][j] + board[i][j+1] + board[i][j+2] + board[i + 1][j+1]; max = Math.max(max, score); score = board[i][j] + board[i][j + 1] + board[i+1][j + 2] + board[i + 1][j + 1]; max = Math.max(max, score); } if (j+1=0&&i+1=0){ int score = board[i][j] + board[i][j + 1] + board[i-1][j + 1] + board[i -2][j + 1]; max = Math.max(max, score); } } } System.out.println(max); } }

제출 #103616

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: