leetcode-363. Max Sum of Rectangle No Larger Than K

题目：

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).

链接：https://leetcode.com/problems/max-sum-of-sub-matrix-no-larger-than-k/

在解决这个问题之前，我们先讨论最大子矩阵和的解法

求一个M*N的矩阵的最大子矩阵和。
比如在如下这个矩阵中：
 0 -2 -7  0
 9  2 -6  2
-4  1 -4  1
-1  8  0 -2 
拥有最大和的子矩阵为：
 9 2
-4 1
-1 8
其和为15。

源码：

#include<iostream>
#include<vector>
#include<list>
#include<fstream>
#include<string>
#include<set>
#include<map>
#include<unordered_set>
#include<algorithm>
#include<stack>
using namespace std;

int uprow = -1, downrow = -1, leftcol = -1, rightcol = -1;
int maxsubmatrix(vector<vector<int>>&matrix) {
	int row = matrix.size();
	int col = matrix[0].size();
	vector<vector<int>>psum = matrix;
	//向下累加计算部分和
	for (int i = 1; i < row; i++){
		for (int j = 0; j < col; j++){
			psum[i][j] = psum[i][j] + psum[i-1][j];
		}
	}
	vector<int>re(col,0);
	//利用最大字段和的思想
	int total_max = -INT_MAX;
	for (int i = 0; i < row; i++){//控制上方的行
		for (int j = i; j <row; j++){//控制下方的行
			for (int k = 0; k < col; k++){//控制列号
				if (i == 0)re[k] = psum[j][k];
				else re[k] = psum[j][k] - psum[i-1][k];	
			}
			//利用最大子段和的思想
			int maxsum=-INT_MAX;
			int k;
			vector<int>sum(col,0);
			sum[0] = re[0];
			leftcol = 0;
			rightcol = 0;
			for (k = 1; k < col; k++){
				sum[k] = max(sum[k-1]+re[k],re[k]);
				if (sum[k]>maxsum){
					maxsum = sum[k];
					rightcol = k;
				}
			}
			if (maxsum > total_max){//确定行的上限和下限
				total_max = maxsum;
				uprow = i;
				downrow = j;
				leftcol = rightcol;
				for (int k = rightcol; k >= 0; k--){
					if (sum[k] == re[k])break;
				}
				leftcol = k;
			};
		}
	}
	return total_max;
}



int main(){
	vector<vector<int>>matrix = { { 0, -2, -7, 0 }, { 9, 2, -6, 2 }, { -4, 1, -4, 1 }, {-1,8,0,-2} };
	cout << maxsubmatrix(matrix) << endl;
	printf("row:%d,%d\n",uprow,downrow);
	printf("col:%d,%d\n", leftcol, rightcol);
	return 0;
}

结果：

可以看到最大子矩阵和为15，从第1行到第3行，第0列到第1列！！！！

思路：

我们先确定行的范围，比如从第i行到第j行，然后对每一行进行向下累加，那么在i到j之间的行就变成1行，这个时候就可以用最大子段和的方法来求解！！！！

对于leetcode的这道题，唯一的区别在于我们把多行整理成一行的时候，这一行的数据我们要算任意两个元素之间的差!!!所以又要引入双重循环，所以我的解答的复杂度达到了

o(n^4),有待改进！！！

源码：

class Solution {
public:
	int maxSumSubmatrix(vector<vector<int>>& matrix, int k) {
		int diff = INT_MAX;
		int near = -INT_MAX,h;
		int row = matrix.size();
		int col = matrix[0].size();
		vector<vector<int>>psum = matrix;
		//向下累加计算部分和
		for (int i = 1; i < row; i++){
			for (int j = 0; j < col; j++){
				psum[i][j] = psum[i][j] + psum[i - 1][j];
			}
		}
		vector<int>re(col, 0);
		//利用最大字段和的思想
		for (int i = 0; i < row; i++){//控制上方的行
			for (int j = i; j <row; j++){//控制下方的行
				for (h = 0; h < col; h++){//控制列号
					if (i == 0)re[h] = psum[j][h];
					else re[h] = psum[j][h] - psum[i - 1][h];
				}
				//求自左向右的累加和
				vector<int>sum(col, 0);
				sum[0] = re[0];
				for (h = 1; h < col; h++)sum[h] = sum[h-1]+re[h];
				
				//双重循环
				int temp_sum;
				for (int m = 0; m < col; m++){
					for (int h = m; h < col; h++){
						if (m == 0)temp_sum = sum[h];
						else temp_sum = sum[h] - sum[m - 1];
						//比较
						int temp_diff = k - temp_sum;
						if (temp_diff >= 0){
							if ( temp_diff< diff){
								diff = temp_diff;
								near = temp_sum;
							}
						}
					}
				}	
	
			}
		}
		return near;
	}
};

Submission Result: Accepted  More Details 

Next challenges:  (H) Palindrome Partitioning II  (H) Paint House II  (E) First Bad Version

Share your acceptance!