363. Max Sum of Rectangle No Larger Than K[hard]

题目：
Given a non-empty 2D matrix matrix and an integer k, find the max sum of a rectangle in the matrix such that its sum is no larger than k.

Example:
Given matrix = [
[1, 0, 1],
[0, -2, 3]
]
k = 2
The answer is 2. Because the sum of rectangle [[0, 1], [-2, 3]] is 2 and 2 is the max number no larger than k (k = 2).

Note:
The rectangle inside the matrix must have an area > 0.
What if the number of rows is much larger than the number of columns?
Credits:
Special thanks to @fujiaozhu for adding this problem and creating all test cases.

---

求不超过k的最大矩形。
相关问题有：
（1）求最大矩形：枚举i,j，将i~j行压缩到一行，然后就是求最大子序列，dp[i] = max(dp[i - 1], 0) + a[i]。时间复杂度O(n^3)
（2）不超过k的最大子序列：设前缀和为b[i]，对于j<=i，求b[i] - b[j] <= k条件下的最小b[j]，即求b[j] >=b[i] - k的最小b[j]。使用set和lower_bound可以在O(nlogn)时间内求解。

所以这个问题应用上面两个子问题的结合，时间复杂度为O(n^3logn)。

题目提醒了一个优化，减小矩阵的行数，这样可以减小枚举i,j（用于压缩）的时间：如果行数过大，可以将矩阵转置，再进行求解。

class Solution {
public:
    int maxSumSubmatrix(vector< vector<int> >& matrix, int k) {
        vector< vector<int> > t;
        if (matrix.size() > matrix[0].size()) {
            t.resize(matrix[0].size());
            for (int i = 0; i < matrix[0].size(); i++) t[i].resize(matrix.size());
            for (int i = 0; i < matrix.size(); i++)
                for (int j = 0; j < matrix[0].size(); j++)
                    t[j][i] = matrix[i][j];
            return solve(t, k);
        }
        else {
            return solve(matrix, k);
        }
    }

    int solve(vector< vector<int> >& matrix, int mx) {
        int ans = -2147483648;
        vector< vector<int> > pre;
        pre.resize(matrix[0].size());
        for (int i = 0; i < matrix[0].size(); i++) {
            pre[i].resize(matrix.size());
            pre[i][0] = matrix[0][i];
            for (int j = 1; j < matrix.size(); j++)
                pre[i][j] = pre[i][j - 1] + matrix[j][i];
        }

        vector<int> b;
        b.resize(matrix[0].size());
        for (int i = 0; i < matrix.size(); i++) {
            for (int j = i; j < matrix.size(); j++) {
                for (int k = 0; k < matrix[0].size(); k++) {
                    if (i != 0) b[k] = pre[k][j] - pre[k][i - 1];
                    else b[k] = pre[k][j];
                }
                for (int k = 1; k < matrix[0].size(); k++)
                    b[k] = b[k - 1] + b[k];

                set<int> s;
                set<int>::iterator it;
                s.insert(0);
                for (int k = 0; k < matrix[0].size(); k++) {
                    it = s.lower_bound(b[k] - mx);
                    if (it != s.end()) ans = max(ans, b[k] - (*it));
                    s.insert(b[k]);
                }
            }
        }
        return ans;
    }
};