#define M 4
#define N 5
//打印子矩形
void printfSubMatrix(int arr[][N], int left, int right, int up, int down) {
if (!arr) {
return;
}
cout << " maxLeft: " << left << " maxRight: " << right << " maxUp: " << up
<< " maxDown: " << down << endl;
cout << "子矩形: " << endl;
for (int i = up; i <= down; ++i) {
for (int j = left; j <= right; ++j) {
cout << arr[i][j] << " ";
}
cout << endl;
}
}
bool initColSumArray(int src[][N], int dest[][N + 1]) {
bool hasPositive = false;
for (int j = 1; j <= N; ++j) {
for (int i = 1; i <= M; ++i) {
if (src[i - 1][j - 1] > 0) {
hasPositive = true;
}
dest[i][j] = dest[i - 1][j] + src[i - 1][j - 1];
}
}
return hasPositive;
}
int findMaxSumFromSubArray(int *ps, int begin, int end, int& left, int& right) {
int curSum = 0;
int maxSum = 0;
int tmpBegin = 0;
for (int i = begin; i <= end; i++) {
curSum = max(curSum + ps[i], ps[i]);
if (curSum == ps[i]) {
tmpBegin = i;
}
maxSum = max(curSum, maxSum);
if (maxSum == curSum) {
left = tmpBegin;
right = i;
}
}
return maxSum;
}
/*穷举所有上下边界,计算每个上下边界围成的矩形的每一列的和,
* 在用一维数组求连续子数组最大和的方式求解*/
int findMaxSumFromSubMatrix(int arr[][N], int bs[][N + 1]) {
int ps[N + 1] = { 0 };
//初始化每一个子矩形的列和
bool hasPositive = initColSumArray(arr, bs);
//没有整数时,返回零
if (!hasPositive) {
return 0;
}
int maxUp = 0;
int maxDown = 0;
int maxLeft = 0;
int maxRight = 0;
int curSum = 0;
int maxSum = 0;
int up = 1;
int down = 1;
for (up = 1; up <= M; ++up) {
for (down = 1; down <= M; ++down) {
for (int i = 1; i <= N; ++i) {
ps[i] = bs[down][i] - bs[up - 1][i];
}
int tmpLeft = 0;
int tmpRight = 0;
if ((curSum = findMaxSumFromSubArray(ps, 1, N, tmpLeft, tmpRight))
> maxSum) {
maxLeft = tmpLeft - 1;
maxRight = tmpRight - 1;
maxUp = up - 1;
maxDown = down - 1;
maxSum = curSum;
}
}
}
printfSubMatrix(arr, maxLeft, maxRight, maxUp, maxDown);
return maxSum;
}
求二维数组最大子数组的和
最新推荐文章于 2019-08-02 04:17:03 发布