问题是,给定一个矩阵,求和最大的子矩阵。比如,下面的矩阵:
和最大的是蓝线框对应的矩阵(和为29)。
解决思路为,把矩阵每行的值累加到一个一维数组上面,然后去求那个一维数组里面和最大的连续子数组。
如果使用 kadane算法,时间复杂度为 O(n^3).
实现如下:
//#include <limits.h>
#include <stdlib.h>
struct max_array
{
int start;
int end;
int value;
};
struct max_array kadane(int *data, int length)
{
int max_sum = 1 << (sizeof(int) * 8 - 1);
int sum = 0;
int i;
int j = 0;
int start =0, end = 0;
for(i = 0; i < length; i++)
{
sum += data[i];
if(sum > max_sum)
{
max_sum = sum;
start = j;
end = i;
}
if(sum < 0)
{
j = i + 1;
sum = 0;
}
}
struct max_array max= {start, end, max_sum};
return max;
}
struct max_matrix
{
int top;
int left;
int right;
int bottom;
int value;
};
#define MAX_COL_SIZE 100
struct max_matrix find_max_matrix(int *data, int row, int col)
{
int i, j;
// int tmp_row[MAX_COL_SIZE];
int *tmp_row = malloc(row * sizeof(int));
for(i = 0; i < row; i++)
{
tmp_row[i] = 0;
}
struct max_matrix submatrix;
submatrix.value = 1 << (sizeof(int) * 8 - 1);
for(i = 0; i < col; i++)
{
int t;
for(t = 0; t < row; t++)
{
tmp_row[t] = 0;
}
for(j = i; j < col; j++)
{
int k;
for(k = 0; k < row; k++)
{
tmp_row[k] += *(data + col * k + j);// data[k][j];
}
struct max_array maxarray = kadane(tmp_row, col);
if(maxarray.value > submatrix.value)
{
submatrix.value = maxarray.value;
submatrix.top = maxarray.start;
submatrix.bottom = maxarray.end;
submatrix.left = i;
submatrix.right = j;
}
}
}
free(tmp_row);
return submatrix;
}
int main(int argc, char **argv)
{
int data[][5] =
{
{1, 2, -1, -4, -20},
{-8, -3, 4, 2, 1},
{3, 8, 10, 1, 3},
{-4, -1, 1, 7, -6}
};
struct max_matrix max = find_max_matrix((int *)data, 4, 5 );
return 0;
}
References:
1. http://www.geeksforgeeks.org/dynamic-programming-set-27-max-sum-rectangle-in-a-2d-matrix/