44.开发商购买土地

题目链接：44.开发商购买土地

思路

先求出每一列（行）的和，然后利用列（行）和求出每一列（行）的前缀和。

利用列（行）的前缀和求出每种划分情况的差值，并找出最小值

代码

#include <iostream>
#include <vector>
#include <cmath>

using namespace std;


int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    
    int n, m;
    cin >> n >> m;
    
    vector<vector<int>> arr(n, vector<int>(m, 0));
    vector<int> prefix_row(n, 0), prefix_col(m, 0);
    
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> arr[i][j];
            prefix_col[j] += arr[i][j];
            prefix_row[i] += arr[i][j];
        }
    }
    
    for (int i = 1; i < n; ++i) {
        prefix_row[i] = prefix_row[i-1]+prefix_row[i];
    }
    for (int j = 1; j < m; ++j) {
        prefix_col[j] = prefix_col[j-1]+prefix_col[j];
    }
    
    int mindiff = 1e9;
    
    for (int i = 0; i < n; ++i) {
        mindiff = min(mindiff, abs(prefix_row[n-1]-2*prefix_row[i]));
    }
    
    for (int j = 0; j < m; ++j) {
        mindiff = min(mindiff, abs(prefix_col[m-1]-2*prefix_col[j]));
    }
    
    cout << mindiff;
    
    return 0;
}