poj1050

To the Max

Description
Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rectangle is the sum of all the elements in that rectangle. In this problem the sub-rectangle with the largest sum is referred to as the maximal sub-rectangle.
As an example, the maximal sub-rectangle of the array:

0 -2 -7 0
9 2 -6 2
-4 1 -4 1
-1 8 0 -2
is in the lower left corner:

9 2
-4 1
-1 8
and has a sum of 15.
Input

The input consists of an N * N array of integers. The input begins with a single positive integer N on a line by itself, indicating the size of the square two-dimensional array. This is followed by N^2 integers separated by whitespace (spaces and newlines). These are the N^2 integers of the array, presented in row-major order. That is, all numbers in the first row, left to right, then all numbers in the second row, left to right, etc. N may be as large as 100. The numbers in the array will be in the range [-127,127].
Output

Output the sum of the maximal sub-rectangle.
Sample Input

4
0 -2 -7 0
9 2 -6 2
-4 1 -4 1
-1 8 0 -2
Sample Output

15

题意 ：

最大子矩阵。

思路： dp

AC代码：

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
#include <string>
#include <stack>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#define INF 0x3f3f3f
#define ll long long
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
inline int Max(int a,int b){ return a>b ? a : b;}
using namespace std;
int a[101][101];
int b[101];
int n;
int main(){
 //   freopen("111.txt", "w", stdout);
    int Max;
    while(scanf("%d",&n)!=EOF){
        Max=-99999999;
        for(int i=1; i<=n; i++){
            for(int j=1; j<=n; j++){
                int x;
                scanf("%d",&x);
                a[i][j]=a[i-1][j]+x;
            }
        }
        int t=0,Maxn;
        for(int i=0;i<n; i++){
            for(int j=i+1; j<=n; j++){
                memset(b,0,sizeof(b));
                for(int k=1; k<=n; k++){
                    b[k]=a[j][k]-a[i][k];
                }
                t=0,Maxn=-9999999;
                for(int k=1; k<=n; k++){
                    if(t>0) t+=b[k];
                    else t=b[k];
                    if(t>Maxn) Maxn=t;
                }
                if(Maxn>Max) Max=Maxn;
            }
        }
        cout << Max << endl;
    }
    return 0;
}