#include #include #include using namespace std; int N, M; int blue (vector > &v) { int max = 0; for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { if (j + 3 < M) { int sum = v[i][j] + v[i][j + 1] + v[i][j + 2] + v[i][j + 3]; if (sum > max) max = sum; } } } for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { if (i + 3 < N) { int sum = v[i][j] + v[i + 1][j] + v[i + 2][j] + v[i + 3][j]; if (sum > max) max = sum; } } } return max; } int yellow(vector > &v) { int max = 0; for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { if (i + 1 < N && j + 1 < M) { int sum = v[i][j] + v[i][j + 1]; sum += v[i + 1][j] + v[i + 1][j + 1]; if (sum > max) max = sum; } } } return max; } int orange(vector > &v) { int max = 0; for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { int sum = 0; if (i + 1 < N && i + 2 < N && j + 1 < M) sum = v[i][j] + v[i + 1][j] + v[i + 2][j] + v[i + 2][j + 1]; if (sum > max) max = sum; if (i + 1 < N && i + 2 < N && j - 1 >= 0) sum = v[i][j] + v[i + 1][j] + v[i + 2][j] + v[i + 2][j - 1]; if (sum > max) max = sum; if (j + 1 < M && j + 2 < M && i + 1 < N) sum = v[i][j] + v[i][j + 1] + v[i][j + 2] + v[i + 1][j]; if (sum > max) max = sum; if (j + 1 < M && j + 2 < M && i + 1 < N) sum = v[i][j] + v[i][j + 1] + v[i][j + 2] + v[i + 1][j + 2]; if (sum > max) max = sum; } } return max; } int green(vector > &v) { int max = 0; for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { int sum = 0; if (i + 1 < N && j + 1 < M && i + 2 < N) sum = v[i][j] + v[i + 1][j] + v[i + 1][j + 1] + v[i + 2][j + 1]; if (sum > max) max = sum; if (i + 1 < N && j - 1 >= 0 && i + 2 < N) sum = v[i][j] + v[i + 1][j] + v[i + 1][j - 1] + v[i + 2][j - 1]; if (sum > max) max = sum; if (i + 1 < N && j + 1 < M && j - 1 >= 0) sum = v[i][j] + v[i][j + 1] + v[i + 1][j] + v[i + 1][j - 1]; if (sum > max) max = sum; if (i + 1 < N && j - 1 >= 0 && j + 1 < M) sum = v[i][j] + v[i][j - 1] + v[i + 1][j] + v[i + 1][j + 1]; if (sum > max) max = sum; } } return max; } int pink(vector>& v) { int max = 0; // 'T' shaped and its rotations for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { if (i + 2 < N && j + 1 < M) { // T vertical int sum = v[i + 1][j] + v[i][j + 1] + v[i + 1][j + 1] + v[i + 2][j + 1]; if (sum > max) max = sum; } if (j + 2 < M && i + 1 < N) { // T horizontal int sum = v[i][j + 1] + v[i + 1][j] + v[i + 1][j + 1] + v[i + 1][j + 2]; if (sum > max) max = sum; } } } return max; } int main() { cin >> N >> M; vector > v(N, vector(M, 0)); for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) cin >> v[i][j]; } vector result = {blue(v), yellow(v), orange(v), green(v), pink(v)}; cout << *max_element(result.begin(), result.end()); return 0; }

제출 #12616

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: