#include #include using namespace std; void search(vector>& v, int x, int y, int& max, int sum) { for(int i = 0; i < 5; i++) { for(int k = 0; k < y; j++) { for(int j = 0; j < x; k++) { if(k + 1 < x - 1 && j + 1 < y - 1) { sum = v[k][j] + v[k + 1][j] + v[k][j + 1] + v[k + 1][j + 1]; if(max < sum) max = sum; } if(k + 3 < x - 1) { sum = v[k][j] + v[k + 1][j] + v[k + 2][j] + v[k + 3][j]; if(max < sum) max = sum; } if(j + 3 < y - 1) { sum = v[k][j] + v[k][j + 1] + v[k][j + 2] + v[k][j + 3]; if(max < sum) max = sum; } if(k + 2 < x - 1 && j + 1 < y - 1) { for(int o = 0; o < 3; o++) { sum = v[k][j] + v[k + 1][j] + v[k + 2][j] + v[k + o][j + 1]; if(max < sum) max = sum; } sum = v[k][j] + v[k + 1][j] + v[k + 1][j + 1] + v[k + 2][j + 1]; if(max < sum) max = sum; } if(k + 1 < x - 1 && j + 2 < y - 1) { for(int o = 0; o < 3; o++) { sum = v[k][j] + v[k][j + 1] + v[k][j + 2] + v[k + 1][j + o]; if(max < sum) max = sum; } sum = v[k][j] + v[k][j + 1] + v[k + 1][j + 1] + v[k + 1][j + 2]; if(max < sum) max = sum; } if(k - 1 >= 0 && j + 2 < y - 1) { for(int o = 0; o < 3; o++) { sum = v[k][j] + v[k][j + 1] + v[k][j + 2] + v[k - 1][j + o]; if(max < sum) max = sum; } sum = v[k][j] + v[k - 1][j] + v[k - 1][j + 1] + v[k - 1][j + 2]; if(max < sum) max = sum; } if(k + 2 < x - 1 && j - 1 >= 0) { for(int o = 0; o < 3; o++) { sum = v[k][j] + v[k + 1][j] + v[k + 2][j] + v[k + o][j - 1]; if(max < sum) max = sum; } sum = v[k][j] + v[k + 1][j] + v[k + 1][j - 1] + v[k + 2][j - 1]; if(max < sum) max = sum; } } } } } int main() { int max {0}, sum {0}; int x, y; int tmp; cin >> y >> x; vector> v(y, vector(x)); for(int i = 0; i < y; i++) { for(int j = 0; j < x; j++) { cin >> tmp; v[i][j] = tmp; } } search(v, x, y, max, sum); cout << max; return 0; }

제출 #71525

제출 정보

제출 결과

제출 코드

찾은 반례