#include #include using namespace std; int N, M, mx = 0; int map[501][501]; void tetA() { for (int i = 0; i < N; i++) { for (int j = 0; j < M - 3; j++) { int score = map[i][j] + map[i][j + 1] + map[i][j + 2] + map[i][j + 3]; mx = max(mx, score); } } for (int i = 0; i < N - 3; i++) { for (int j = 0; j < M; j++) { int score = map[i][j] + map[i + 1][j] + map[i + 2][j] + map[i + 3][j]; mx = max(mx, score); } } return; } void tetB() { for (int i = 0; i < N - 1; i++) { for (int j = 0; j < M - 1; j++) { int score = map[i][j] + map[i][j + 1] + map[i + 1][j] + map[i + 1][j + 1]; mx = max(mx, score); } } return; } void tetCE() { for (int i = 0; i < N - 2; i++) { for (int j = 0; j < M - 1; j++) { int score = map[i][j] + map[i + 1][j] + map[i + 2][j]; for (int k = 0; k < 3; k++) { score += map[i + k][j + 1]; mx = max(mx, score); score -= map[i + k][j + 1]; } } } for (int i = 0; i < N - 2; i++) { for (int j = 1; j < M; j++) { int score = map[i][j] + map[i + 1][j] + map[i + 2][j]; for (int k = 0; k < 3; k++) { score += map[i + k][j - 1]; mx = max(mx, score); score -= map[i + k][j - 1]; } } } for (int i = 0; i < N - 1; i++) { for (int j = 0; j < M - 2; j++) { int score = map[i][j] + map[i][j + 1] + map[i][j + 2]; for (int k = 0; k < 3; k++) { score += map[i + 1][j + k]; mx = max(mx, score); score -= map[i + 1][j + k]; } } } for (int i = 1; i < N - 1; i++) { for (int j = 0; j < M - 2; j++) { int score = map[i][j] + map[i][j + 1] + map[i][j + 2]; for (int k = 0; k < 3; k++) { score += map[i - 1][j + k]; mx = max(mx, score); score -= map[i - 1][j + k]; } } } } void tetD() { for (int i = 0; i < N - 2; i++) { for (int j = 0; j < M - 1; j++) { int score = map[i][j] + map[i + 1][j] + map[i + 1][j + 1] + map[i + 2][j + 1]; mx = max(mx, score); score = map[i][j + 1] + map[i + 1][j + 1] + map[i + 1][j] + map[i + 2][j]; mx = max(mx, score); } } for (int i = 0; i < N - 1; i++) { for (int j = 0; j < M - 2; j++) { int score = map[i][j] + map[i][j + 1] + map[i + 1][j + 1] + map[i + 1][j + 2]; mx = max(mx, score); score = map[i + 1][j] + map[i + 1][j + 1] + map[i][j + 1] + map[i][j + 2]; mx = max(mx, score); } } return; } void process() { tetA(); tetB(); tetCE(); tetD(); return; } int main(void) { ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> N >> M; for (int i = 0; i < N; i++) for (int j = 0; j < M; j++) cin >> map[i][j]; process(); cout << mx << "\n"; return 0; }

제출 #38652

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: