#include #include int arr[502][502]; int n, m; int max = 0; void judge(int num) { if (num > max) { max = num; } return; } void first_block() { int tmp = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m - 3; j++) { tmp = arr[i][j] + arr[i][j + 1] + arr[i][j + 2] + arr[i][j + 3]; judge(tmp); } } for (int i = 0; i < n - 3; i++) { for (int j = 0; j < m; j++) { tmp = arr[i][j] + arr[i+1][j] + arr[i+2][j] + arr[i+3][j]; judge(tmp); } } return; } void second_block() { int tmp = 0; for (int i = 0; i < n - 1; i++) { for (int j = 0; j < m - 1; j++) { tmp = arr[i][j] + arr[i][j + 1] + arr[i + 1][j] + arr[i + 1][j + 1]; judge(tmp); } } return; } void third_block() { int tmp = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m - 2; j++) { tmp = arr[i][j] + arr[i][j + 1] + arr[i][j + 2]; if (i > 0) { judge(tmp + arr[i - 1][j]); judge(tmp + arr[i - 1][j + 2]); } judge(tmp + arr[i + 1][j]); judge(tmp + arr[i + 1][j + 2]); } } for (int i = 0; i < n - 2; i++) { for (int j = 0; j < m; j++) { tmp = arr[i][j] + arr[i + 1][j] + arr[i + 2][j]; if (i > 0) { judge(tmp + arr[i][j - 1]); judge(tmp + arr[i + 2][j - 1]); } judge(tmp + arr[i][j + 1]); judge(tmp + arr[i + 2][j + 1]); } } return; } void forth_block() { int tmp = 0; for (int i = 1; i < n - 1; i++) { for (int j = 0; j < m - 1; j++) { tmp = arr[i][j] + arr[i][j + 1]; judge(tmp + arr[i-1][j] + arr[i + 1][j + 1]); judge(tmp + arr[i + 1][j] + arr[i-1][j + 1]); } } for (int i = 0; i < n - 1; i++) { for (int j = 1; j < m - 1; j++) { tmp = arr[i][j] + arr[i + 1][j]; judge(tmp + arr[i][j - 1] + arr[i + 1][j + 1]); judge(tmp + arr[i][j + 1] + arr[i + 1][j - 1]); } } return; } void fifth_block() { int tmp; for (int i = 1; i < n; i++) { for (int j = 1; j < m - 1; j++) { tmp = arr[i][j] + arr[i][j - 1] + arr[i][j + 1] + arr[i - 1][j]; judge(tmp); } } for (int i = 1; i < n - 1; i++) { for (int j = 0; j < m - 1; j++) { tmp = arr[i][j] + arr[i+1][j] + arr[i][j + 1] + arr[i - 1][j]; judge(tmp); } } for (int i = 1; i < n - 1; i++) { for (int j = 1; j < m; j++) { tmp = arr[i][j] + arr[i + 1][j] + arr[i][j - 1] + arr[i - 1][j]; judge(tmp); } } for (int i = 0; i < n - 1; i++) { for (int j = 1; j < m - 1; j++) { tmp = arr[i][j] + arr[i + 1][j] + arr[i][j - 1] + arr[i][j + 1]; judge(tmp); } } } int main() { for (int i = 0; i < 502; i++) { // 초기화. for (int j = 0; j < 502; j++) { arr[i][j] = 0; } } std::cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { std::cin >> arr[i][j]; } } first_block(); second_block(); third_block(); forth_block(); fifth_block(); std::cout << max; return 0; }

제출 #11366

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: