#include using namespace std; int board[505][505]; int ans; int MAX; void tet1(int n, int m) { for (int i = 0; i < n; i++) { for (int j = 0; j < m - 3; j++) { MAX = 0; bool no = 0; for (int k = j; k < j + 4; k++) { if (k >= m) { no = 1; continue; } MAX += board[i][k]; } if (no) continue; if (ans < MAX) ans = MAX; } } for (int i = 0; i < m; i++) { for (int j = 0; j < n - 3; j++) { MAX = 0; bool no = 0; for (int k = j; k < j + 4; k++) { if (k >= n) { no = 1; continue; } MAX += board[k][i]; } if (no) continue; if (ans < MAX) ans = MAX; } } } void tet2(int n, int m) { for (int i = 0; i < n - 1; i++) { for (int j = 0; j < m - 1; j++) { MAX = 0; bool no = 0; for (int k = i; k < i + 2; k++) { for (int l = j; l < j + 2; l++) { if (k >= n || l >= m) { no = 1; continue; } MAX += board[k][l]; } } if (no) continue; if (ans < MAX) ans = MAX; } } } void tet3(int n, int m) { for (int i = 0; i < n - 2; i++) { for (int j = 0; j < m - 1; j++) { MAX = 0; for (int k = i; k < i + 3; k++) { MAX += board[k][j]; if (k == i + 2) MAX += board[k][j + 1]; } if (ans < MAX) ans = MAX; } } for (int i = 0; i < n - 1; i++) { for (int j = 0; j < m - 2; j++) { MAX = 0; for (int k = j; k < j + 3; k++) { MAX += board[i][k]; if (k == j) MAX += board[i + 1][k]; } if (ans < MAX) ans = MAX; } } for (int i = 0; i < n - 2; i++) { for (int j = 1; j < m; j++) { MAX = 0; for (int k = i; k < i + 3; k++) { MAX += board[k][j]; if (k == i) MAX += board[k][j - 1]; } if (ans < MAX) ans = MAX; } } for (int i = 1; i < n; i++) { for (int j = 0; j < m - 2; j++) { MAX = 0; for (int k = j; k < j + 3; k++) { MAX += board[i][k]; if (k == j + 2) MAX += board[i - 1][k]; } if (ans < MAX) ans = MAX; } } for (int i = 0; i < n - 2; i++) { for (int j = 1; j < m; j++) { MAX = 0; for (int k = i; k < i + 3; k++) { MAX = board[k][j]; if (k == i + 2) MAX += board[k][j - 1]; } if (ans < MAX) ans = MAX; } } for (int i = 1; i < n; i++) { for (int j = 0; j < m - 2; j++) { MAX = 0; for (int k = j; k < j + 3; k++) { MAX += board[i][k]; if (k == j) MAX += board[i - 1][k]; } if (ans < MAX) ans = MAX; } } for (int i = 0; i < n - 2; i++) { for (int j = 0; j < m - 1; j++) { MAX = 0; for (int k = i; k < i + 3; k++) { MAX += board[k][j]; if (k == i) MAX += board[k][j + 1]; } if (ans < MAX) ans = MAX; } } for (int i = 0; i < n - 1; i++) { for (int j = 0; j < m - 2; j++) { MAX = 0; for (int k = j; k < j + 3; k++) { MAX += board[i][k]; if (k == j + 2) MAX += board[i + 1][k]; } if (ans < MAX) ans = MAX; } } } void tet4(int n, int m) { for (int i = 0; i < n - 2; i++) { for (int j = 0; j < m - 1; j++) { MAX = 0; for (int k = i; k < i + 2; k++) { MAX += board[k][j]; if (k == i + 1) MAX += board[k][j + 1] + board[k + 1][j + 1]; } if (ans < MAX) ans = MAX; } } for (int i = 1; i < n; i++) { for (int j = 0; j < m - 2; j++) { MAX = 0; for (int k = j; k < j + 2; k++) { MAX += board[i][k]; if (k == j + 1) MAX += board[i - 1][k] + board[i - 1][k + 1]; } if (ans < MAX) ans = MAX; } } for (int i = 0; i < n - 2; i++) { for (int j = 1; j < m; j++) { MAX = 0; for (int k = i; k < i + 2; k++) { MAX += board[k][j]; if (k == i + 1) MAX += board[k][j - 1] + board[k + 1][j - 1]; } if (ans < MAX) ans = MAX; } } for (int i = 0; i < n - 1; i++) { for (int j = 0; j < m - 2; j++) { MAX = 0; for (int k = 0; k < j + 2; k++) { MAX += board[i][k]; if (k == j + 1) MAX += board[i + 1][k] + board[i + 1][k + 1]; } if (ans < MAX) ans = MAX; } } } void tet5(int n, int m) { for (int i = 0; i < n - 1; i++) { for (int j = 0; j < m - 2; j++) { MAX = 0; for (int k = j; k < j + 3; k++) { MAX += board[i][k]; if (k == j + 1) MAX += board[i + 1][k]; } if (ans < MAX) ans = MAX; } } for (int i = 0; i < n - 2; i++) { for (int j = 1; j < m; j++) { MAX = 0; for (int k = i; k < i + 3; k++) { MAX += board[k][j]; if (k == i + 1) MAX += board[k][j - 1]; } if (ans < MAX) ans = MAX; } } for (int i = 1; i < n; i++) { for (int j = 0; j < m - 2; j++) { MAX = 0; for (int k = j; k < j + 3; k++) { MAX += board[i][k]; if (k == j + 1) MAX += board[i - 1][j]; } if (ans < MAX) ans = MAX; } } for (int i = 0; i < n - 2; i++) { for (int j = 0; j < m - 1; j++) { MAX = 0; for (int k = i; k < i + 3; k++) { MAX += board[k][j]; if (k == i + 1) MAX += board[k][j + 1]; } if (ans < MAX) ans = MAX; } } } int main() { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> board[i][j]; } } tet1(n, m); tet2(n, m); tet3(n, m); tet4(n, m); tet5(n, m); cout << ans; return 0; }

제출 #38515

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: