#include int main() { int arr[1001][1001]; int n, m, i, j, max=-1; scanf("%d %d", &n, &m); for (i=1;i<=n;i++){ for (j=1;j<=m;j++) scanf("%d", &arr[i][j]); } //I for (i=1;i<=n;i++){ for (j=1;j<=m-3;j++){ if (arr[i][j]+arr[i][j+1]+arr[i][j+2]+arr[i][j+3] > max) max=arr[i][j]+arr[i][j+1]+arr[i][j+2]+arr[i][j+3]; } } for (i=1;i<=n-3;i++){ for (j=1;j<=m;j++){ if (arr[i][j]+arr[i+1][j]+arr[i+2][j]+arr[i+3][j] > max) max=arr[i][j]+arr[i+1][j]+arr[i+2][j]+arr[i+3][j]; } } //O for (i=1;i<=n-1;i++){ for (j=1;j<=m-1;j++){ if (arr[i][j]+arr[i+1][j]+arr[i][j+1]+arr[i+1][j+1] > max) max=arr[i][j]+arr[i+1][j]+arr[i][j+1]+arr[i+1][j+1]; } } //3*2 for (i=1;i<=n-1;i++){ for (j=1;j<=m-2;j++){ if (arr[i][j]+arr[i][j+1]+arr[i][j+2]+arr[i+1][j] > max) max=arr[i][j]+arr[i][j+1]+arr[i][j+2]+arr[i+1][j]; if (arr[i][j]+arr[i][j+1]+arr[i][j+2]+arr[i+1][j+1] > max) max=arr[i][j]+arr[i][j+1]+arr[i][j+2]+arr[i+1][j+1]; if (arr[i][j]+arr[i][j+1]+arr[i][j+2]+arr[i+1][j+2] > max) max=arr[i][j]+arr[i][j+1]+arr[i][j+2]+arr[i+1][j+2]; if (arr[i+1][j]+arr[i+1][j+1]+arr[i+1][j+2]+arr[i][j] > max) max=arr[i+1][j]+arr[i+1][j+1]+arr[i+1][j+2]+arr[i][j]; if (arr[i+1][j]+arr[i+1][j+1]+arr[i+1][j+2]+arr[i][j+1] > max) max=arr[i+1][j]+arr[i+1][j+1]+arr[i+1][j+2]+arr[i][j+1]; if (arr[i+1][j]+arr[i+1][j+1]+arr[i+1][j+2]+arr[i][j+2] > max) max=arr[i+1][j]+arr[i+1][j+1]+arr[i+1][j+2]+arr[i][j+2]; if (arr[i][j]+arr[i][j+1]+arr[i+1][j+1]+arr[i+1][j+2] > max) max=arr[i][j]+arr[i][j+1]+arr[i+1][j+1]+arr[i+1][j+2]; if (arr[i+1][j]+arr[i][j+1]+arr[i+1][j+1]+arr[i][j+2] > max) max=arr[i+1][j]+arr[i][j+1]+arr[i+1][j+1]+arr[i][j+2]; } } //2*3 for (i=1;i<=n-2;i++){ for (j=1;j<=n-1;j++){ if (arr[i][j]+arr[i+1][j]+arr[i+2][j]+arr[i][j+1] > max) max=arr[i][j]+arr[i+1][j]+arr[i+2][j]+arr[i][j+1]; if (arr[i][j]+arr[i+1][j]+arr[i+2][j]+arr[i+1][j+1] > max) max=arr[i][j]+arr[i+1][j]+arr[i+2][j]+arr[i+1][j+1]; if (arr[i][j]+arr[i+1][j]+arr[i+2][j]+arr[i+2][j+1] > max) max=arr[i][j]+arr[i+1][j]+arr[i+2][j]+arr[i+2][j+1]; if (arr[i][j+1]+arr[i+1][j+1]+arr[i+2][j+1]+arr[i][j] > max) max=arr[i][j+1]+arr[i+1][j+1]+arr[i+2][j+1]+arr[i][j]; if (arr[i][j+1]+arr[i+1][j+1]+arr[i+2][j+1]+arr[i+1][j] > max) max=arr[i][j+1]+arr[i+1][j+1]+arr[i+2][j+1]+arr[i+1][j]; if (arr[i][j+1]+arr[i+1][j+1]+arr[i+2][j+1]+arr[i+2][j] > max) max=arr[i][j+1]+arr[i+1][j+1]+arr[i+2][j+1]+arr[i+2][j]; if (arr[i][j]+arr[i+1][j]+arr[i+1][j+1]+arr[i+2][j+1] > max) max=arr[i][j]+arr[i+1][j]+arr[i+1][j+1]+arr[i+2][j+1]; if (arr[i+2][j]+arr[i+1][j]+arr[i+1][j+1]+arr[i][j+1] > max) max=arr[i+2][j]+arr[i+1][j]+arr[i+1][j+1]+arr[i][j+1]; } } printf("%d", max); return 0; }

제출 #86081

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: