private static int maxSubMatrix(int x[][])
{
int maxSum = 0;
int[] b = new int[x[0].length];
for (int i = 0; i < x.length; ++i)
{
for (int k = 0; k < x[0].length; ++k)
b[k] = 0;
for (int j = i; j < x.length; ++j)
{
for (int k = 0; k < x[0].length; ++k)
{
b[k] += x[j][k];
}
int max = maxSubArray(b);
if (max > maxSum)
maxSum = max;
}
}
return maxSum;
}
maxSubMatrix
最新推荐文章于 2021-07-21 19:41:27 发布