最大子矩阵和问题 对于给定的m 行n 列的整数矩阵，编程计算其最大子矩阵和。-matrix and the biggest problem for a given m trip out of the integer n matrix calculation of its programming matrix and the greatest son.

最大子矩阵和问题 对于给定的m 行n 列的整数矩阵，编程计算其最大子矩阵和。-matrix and the biggest problem for a given m trip out of the integer n matrix calculation of its programming matrix and the greatest son.

计算最大子列和 并使用最低的时间复杂度，真的特别厉害(Compute maximum subsequence sum)