求二维数组的子数组中的最大值!

具体代码如下:

#include<iostream>

using namespace std;

int maxSubMatrix_BF(int *a, int m, int n) 

    int mm=NM,sum=0; 
    for(int i=0;i<m;i++) 
    { 
        for(int j=0;j<n;j++) 
        { 
            for(int ii=i;ii<m;ii++) 
            { 
                for(int jj=j;jj<n;jj++) 
                { 
                    sum = 0; 
                    for(int ti=i; ti<=ii;ti++) 
                        for(int tj=j; tj<=jj;tj++) 
                        { 
                            sum += a[ti*n+tj];///a[ii][jj] ///sum of a[i][j] -> a[ii][jj]  
                        } 
                    mm  = max(sum,mm); 
                } 
            } 
        } 
    } 
     cout<<"最大的子数组和:"<<mm<<endl;

int main()

 {

  int a[2][3]={{1,3,5,-1},{2,-4,6,-6},{4,14,-8,4},{1,4,-3,-5}};

    maxSubMatrix_BF( a, 2,3);

  }

原文地址:https://www.cnblogs.com/dxl12306/p/3612123.html