【HDOJ】1081 To The Max

暴力解。

#include <stdio.h>

#define MAXNUM 105

int map[MAXNUM][MAXNUM];

int main() {
    int i, j, p, q, tmp, n, max, sum;

    while (scanf("%d", &n) != EOF) {
        for (i=1; i<=n; ++i)
            for (j=1; j<=n; ++j)
                scanf("%d", &map[i][j]);
        max = 0;
        for (i=1; i<=n; ++i) {
            for (j=i; j<=n; ++j) {
                sum = 0;
                for (p=1; p<=n; ++p) {
                    tmp = 0;
                    for (q=i; q<=j; ++q)
                        tmp += map[p][q];
                    sum += tmp;
                    if (sum < 0)
                        sum = 0;
                    if (max < sum)
                        max = sum;
                }
            }
        }
        printf("%d\n", max);
    }

    return 0;
}