PROG-T1044: Road Cut

#include <iostream>
#include <vector>
using namespace std;

int main(){

    int row, col;
    scanf("%d", &row);
    scanf("%d", &col);

    vector<int> berow(row + 1, 0);
    vector<int> becol(col + 1, 0);
    int sum = 0;
    for(int i = 1; i <= row; ++i){
        for(int j = 1; j <= col; ++j){
            int x;
            scanf("%d", &x);
            berow[i] += x;
            becol[j] += x;
            sum += x;
        }
    }

    vector<int> afrow(row + 2, 0);
    vector<int> afcol(col + 2, 0);
    for(int i = 1; i <= row; ++i){
        for(int j = 1; j <= col; ++j){
            int x;
            scanf("%d", &x);
            afrow[i] += x;
            afcol[j] += x;
        }
    }

    int mx = 0;
    for(int i = 1; i <= row; ++i){
        mx = max(mx, sum + afrow[i - 1] + afrow[i + 1] - berow[i]);
    }
    for(int i = 1; i <= col; ++i){
        mx = max(mx, sum + afcol[i - 1] + afcol[i + 1] - becol[i]);
    }

    cout << mx;

    return 0;
}