uva10755 - Garbage Heap

题意：
求最大子立方体和
思路：
这题是二维版的最大子矩阵和问题和一维版的最大子段和问题的三维版，预处理arr[k][i][j]，表示该小块同层arr[k][1][1]~arr[k][i][j]之和，和该题二维版的解法类似，该问题即为按层求最大和。

代码如下：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 25;
long long  arr[N][N][N];

int main() {
    int cas;
    scanf("%d", &cas);
    while (cas--) {
        int k, i, j;
        int a, b, c;
        scanf("%d%d%d", &a, &b, &c);
        memset(arr, 0, sizeof(arr));
        for (k = 1; k <= a; k++)
            for (i = 1; i <= b; i++)
                for (j = 1; j <= c; j++) {
                    scanf("%lld", &arr[k][i][j]);
                    arr[k][i][j] += arr[k][i - 1][j] + arr[k][i][j - 1] - arr[k][i - 1][j - 1];
                }
        int m, n, p, q, x;
        long long sum,maxSum,ans=arr[1][1][1];
        //枚举上下行
        for (m = 1; m <= b; m++)
            for (n = m; n <= b; n++)
                //枚举左右列
                for (p = 1; p <= c; p++)
                    for (q = p; q <= c; q++) {
                        //枚举层
                        maxSum = 0;
                        for (x = 1; x <= a; x++) {
                            sum = arr[x][n][q] - arr[x][m - 1][q] - arr[x][n][p - 1] + arr[x][m - 1][p - 1];
                            maxSum = max(maxSum + sum, sum);
                            ans = max(ans, maxSum);
                        }
                    }
        printf("%lld\n", ans);
        if (cas)
            printf("\n");

    }
    return 0;
}