POJ 1050 To the max

看了别人的码写出来的，我觉得二维转换成一维的这个思想非常巧妙啊！～～～

#include <cstdio>#include <cstring>#include <iostream>using namespace std;int temp[1000];int one_sum(int *arr, int n) { //求一维子序列最大和  int sum = 0, max = 0;  for (int i = 1; i <= n; i++) {    sum = (sum > 0) ? (sum + arr[i]) : arr[i];    if (sum > max)      max = sum;  }  return max;}int maxM(int arr[][1000], int n) {  int max = arr[1][1];  int sum = 0;  for (int i = 1; i <= n; i++) {    memset(temp, 0, sizeof(temp));    for (int j = i; j <= n; j++) {      for (int k = 1; k <= n; k++) {        temp[k] += arr[j][k];      }      sum = one_sum(temp, n);      if (sum > max)        max = sum;    }  }  return max;}int main(void) {  int N;  int A[1000][1000];  while (~scanf("%d", &N)) {    for (int i = 1; i <= N; i++) {      for (int j = 1; j <= N; j++) {        scanf("%d", &A[i][j]);      }    }    printf("%d\n", maxM(A, N));  }  return 0;}