最大子矩阵和的N6N4N3次算法 Given an NN integer matrix (aij)NN , find the maximum value of a 1 i m N and 1 j n N . For convenience, the maximum submatrix sum is 0