最大子矩阵

dp的方法

与之前代码对比：https://mp.csdn.net/postedit/87894179

代码如下：

package jisuanke;

import java.util.Scanner;

public class L1 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		int[][] nums = new int[n + 1][m + 1];
		int ans = 0;
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				nums[i][j] = sc.nextInt();
				ans = Math.max(ans, nums[i][j]);
			}
		}
		int[][] pre = new int[n + 1][m + 1];
		if (ans <= 0) {
			System.out.println(ans);
		} else {
			for (int i = 1; i <= n; i++) {
				for (int j = 1; j <= m; j++) {
					pre[i][j] = pre[i - 1][j] + nums[i][j];
				}
			}
			for (int up = 1; up <= n; up++) {// 子矩阵的上界
				for (int down = up; down <= n; down++) {// 子矩阵的下界
					int sum = 0;
					for (int k = 1; k <= m; k++) {
						if (sum + pre[down][k] - pre[up - 1][k] < 0)// 和最大子序和差不多
							sum = 0;
						else {
							sum += pre[down][k] - pre[up - 1][k];
						}
						ans = Math.max(ans, sum);
					}

				}
			}
			System.out.println(ans);
		}

	}

}