363.矩形区域不超过 K 的最大数值和

class Solution {
public:
    int maxSumSubmatrix(vector<vector<int>>& matrix, int cmp) {
        vector<int> ans;
        int row = matrix.size();
        int col = matrix[0].size();
        int mx = INT_MIN;
        //转化为一维数组
        for (int i = 0; i < row; ++i) {
            vector<int> dp(col, 0);
            for (int j = i; j < row; ++j) {
                int pre = 0;
                for (int k = 0; k < col; ++k) {
                    dp[k] += matrix[j][k];
                    if (pre > 0) {
                        pre += dp[k];
                    }
                    else {
                        pre = dp[k];
                    }
                    if (pre > mx) {
                        mx = pre;
                    }
                }
                //若求解得到的最大值大于阈值，则暴力求解，求出小于等于阈值的最大值
                //ans存放的即为每个子矩阵小于等于阈值的最大值
                if (mx > cmp) {
                    mx = INT_MIN;
                    for (int i = 0; i < col; ++i)
                    {
                        int sum = 0;
                        for (int j = i; j < col; ++j)
                        {
                            sum += dp[j];
                            if (sum == cmp)
                                return cmp;
                            if (sum <= cmp && sum > mx)
                                mx = sum;
                        }
                    }
                    ans.push_back(mx);
                }
                else {
                    ans.push_back(mx);
                }
            }
        }
        return *max_element(ans.begin(), ans.end());
    }
};