2160 - 方格取数（number） 代码+题解分析

import java.io.*;
public class DP_2160 {
    private static StreamTokenizer st = new StreamTokenizer( new BufferedReader(
        new InputStreamReader(System.in)));
    private static int nextInt() {
        try {
            st.nextToken();
            return (int)st.nval;
        }catch(IOException e) {
            throw new RuntimeException(e);
        }
    }
    public int findMax(int[][] array, int n, int m) {
        int[][][] map = new int[m][n][n];
        for(int col = 0; col < m; col++) {
            int[] sum =new int[n];
            sum[0] = array[0][0];
            for(int i = 1; i < n; i++) {
                sum[i] = sum[i - 1] + array[i][col];
            }
            for(int from = 0; from < n; from++) {
                for(int to = from; to < n; to++) {
                    map[col][from][to] = sum[to] - sum[from] + array[from][col];