import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". public class Main { static int N,M; static int[][] arr; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); N = Integer.parseInt(st.nextToken()); M = Integer.parseInt(st.nextToken()); arr = new int[N][M]; for (int i = 0; i < N; i++) { st = new StringTokenizer(br.readLine()); for (int j = 0; j < M; j++) { arr[i][j] = Integer.parseInt(st.nextToken()); } } int max= Integer.MIN_VALUE; // 일자 for (int i = N-1; i >=0; i--) { for (int j = 0; j < M; j++) { for (int k = 0; k < 2; k++) { if (k==0){ if ((j+3) >= M) { continue; } max = Math.max(max,count(arr,i,j,1,0)); } else if (k==1) { if ((i-3)<0){ continue; } max = Math.max(max,count(arr,i,j,1,1)); } } } } // 정사각형 for (int i = N-1; i>= 0; i--) { for (int j = 0; j < M; j++) { if ((i-1) < 0) { continue; } if ((j + 1) >= M) { continue; } max= Math.max(max,count(arr,i,j,2,0)); } } // L자 for (int i = N-1; i>= 0; i--) { for (int j = 0; j < M; j++) { for (int k = 0; k < 4; k++) { if (k==0) { if ((i-2) < 0) { continue; } if ((j-1) < 0) { continue; } max = Math.max(max,count(arr,i,j,3,0)); } else if (k==1) { if ((j+2)>= M) { continue; } if ((i-1)<0) { continue; } int sum = 0; sum += arr[i][j]; sum += arr[i][j+1]; sum += arr[i][j+2]; sum += arr[i-1][j+2]; max = Math.max(sum,max); } else if (k==2) { if ((i-2) < 0) { continue; } if ((j-1) < 0) { continue; } int sum = 0; sum += arr[i][j]; sum += arr[i-1][j]; sum += arr[i-2][j]; sum += arr[i-2][j-1]; max = Math.max(sum,max); } else if (k==3) { if ((j+2)>= M) { continue; } if ((i-1)<0) { continue; } int sum = 0; sum += arr[i][j]; sum += arr[i-1][j]; sum += arr[i-1][j+1]; sum += arr[i-1][j+2]; max = Math.max(sum,max); } } } } // 대칭 L for (int i = N-1; i>= 0; i--) { for (int j = 0; j < M; j++) { for (int k = 0; k < 4; k++) { if (k==0) { if ((i-2) < 0) { continue; } if ((j+1) >= M) { continue; } int sum = 0; sum += arr[i][j]; sum += arr[i][j+1]; sum += arr[i-1][j+1]; sum += arr[i-2][j+1]; max = Math.max(sum,max); } else if (k==1) { if ((j-2) < 0) { continue; } if ((i+1)>=N) { continue; } int sum = 0; sum += arr[i][j]; sum += arr[i+1][j]; sum += arr[i][j-1]; sum += arr[i][j-2]; max = Math.max(sum,max); } else if (k==2) { if ((i+2) >= N) { continue; } if ((j-1) < 0) { continue; } int sum = 0; sum += arr[i][j]; sum += arr[i+1][j-1]; sum += arr[i+2][j-1]; sum += arr[i][j-1]; max = Math.max(sum,max); } else if (k==3) { if ((j+2)>= M) { continue; } if ((i+1)>=N) { continue; } int sum = 0; sum += arr[i][j]; sum += arr[i+1][j]; sum += arr[i+1][j+1]; sum += arr[i+1][j+2]; max = Math.max(sum,max); } } } } // 중간 모형자 for (int i = N-1; i>= 0; i--) { for (int j = 0; j < M; j++) { if ((j-1) < 0) { continue; } if ((i-2)<0) { continue; } max = Math.max(max,count(arr,i,j,4,0)); } } // 중간 모형자 for (int i = N-1; i>= 0; i--) { for (int j = 0; j < M; j++) { for (int k = 0; k < 3; k++) { if (k==0) { if ((j+2)>= M) { continue; } if ((i-1)< 0) { continue; } int sum = 0; sum += arr[i][j]; sum += arr[i][j+1]; sum += arr[i-1][j+1]; sum += arr[i-1][j+2]; max = Math.max(sum,max); } else if (k==1) { if ((i-2) < 0) { continue; } if ((j+1)>=M) { continue; } int sum = 0; sum += arr[i][j]; sum +=arr[i-1][j]; sum += arr[i-1][j+1]; sum += arr[i-2][j+1]; max = Math.max(sum,max); } else if (k==2) { if ((i-1) < 0) { continue; } if (j-2 < 0) { continue; } int sum = 0; sum += arr[i][j]; sum += arr[i][j-1]; sum += arr[i-1][j-1]; sum += arr[i-1][j-2]; max = Math.max(sum,max); } } } } // 뒤집어진 엿자 for (int i = N-1; i>= 0; i--) { for (int j = 0; j < M; j++) { if ((j-2)<0) { continue; } if ((i+1)>=N) { continue; } max= Math.max(max,count(arr,i,j,5,0)); } } // 뒤집어진 엿자 회전 for (int i = N-1; i>= 0; i--) { for (int j = 0; j < M; j++) { for (int k = 0; k < 3; k++) { if (k==1) { if (i-1 < 0) { continue; } if (j+2 >= M) { continue; } int sum = 0; sum += arr[i][j]; sum += arr[i][j+1]; sum += arr[i][j+2]; sum += arr[i-1][j+1]; max = Math.max(sum,max); } else if (k==2) { if ((i-2) < 0) { continue; } if (j-1 < 0) { continue; } int sum = 0; sum += arr[i][j]; sum += arr[i-1][j-1]; sum += arr[i-2][j]; sum += arr[i-1][j]; max = Math.max(sum,max); } else if (k==3) { if ((i-2) <0) { continue; } if (j+1 >= M) { continue; } int sum = 0; sum += arr[i][j]; sum += arr[i-1][j]; sum += arr[i-1][j+1]; sum += arr[i-2][j]; max = Math.max(sum,max); } } } } System.out.println(max); } public static int count(int[][] temp, int x,int y,int type,int type2) { int sum = 0; if (type==1) { if (type2==1) { sum += arr[x][y]; sum += arr[x-1][y]; sum += arr[x-2][y]; sum += arr[x-3][y]; } else { sum += arr[x][y]; sum += arr[x][y+1]; sum += arr[x][y+2]; sum += arr[x][y+3]; } } else if (type == 2) { sum += arr[x][y]; sum += arr[x-1][y]; sum += arr[x][y+1]; sum+=arr[x-1][y+1]; } else if (type == 3) { sum += arr[x][y]; sum += arr[x][y-1]; sum += arr[x-1][y-1]; sum += arr[x-2][y-1]; } else if (type == 4) { sum += arr[x][y]; sum += arr[x-1][y]; sum += arr[x-1][y-1]; sum += arr[x-2][y-1]; } else if (type ==5) { sum += arr[x][y]; sum += arr[x+1][y-1]; sum += arr[x][y-1]; sum += arr[x][y-2]; } return sum; } }

제출 #35191

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: