返回一个二维整数数组最大子数组的和

 //二维整数数组最大子数组之和
  #include <iostream>
  #include <stdlib.h>
  #include <time.h>
  using namespace std;

  int main()
  {
     int M,N;
     cout << "输入二维数组的行数和列数：" << endl;
     cin >> M >> N;
     int data[M][N],line[N],sum = 0,d1 = 0;
     int MaxSum ,Maxd1,end1[M][N] = {0},end2[M][N] = {0};
     int i_max = 0,j_max = 0;
     srand((unsigned int)time(0));  //保证生成不同的随机数
     cout << "二维数组为：" << endl;
     for (int j = 0;j < M;j++)   //给二维数组的元素赋值并输出，取值范围是-25到25
     {
         for (int k = 0;k < N;k++)
         {
             data[j][k] = rand()%50 - 25;
             cout << data[j][k] << ‘\t‘;
         }
         cout << endl;
     }
     cout << endl;

     MaxSum = data[0][0];    //初值赋值为数组第一行第一个元素
     Maxd1 = data[0][0];
     for (int i = 0;i < M;i++)
     {
         for (int i1 = 0;i1 < M-i;i1++)//当1行是循环M次
         {
             for (int j = 0;j < N;j++)//赋初值
             {
                 line[j] = 0;
             }
             for (int i2 = i1;i2 <= i1+i;i2++)//每次循环i次赋值
             {
                 for (int j = 0;j < N;j++)
                 {
                     line[j] += data[i2][j];
                 }
             }
             sum = 0;
             for (int k = 0;k < N;k++)
             {
                 sum += line[k];
                 if (sum > MaxSum)
                 {
                     MaxSum = sum;
                     end1[i][i1] = k;
                     i_max = i;       //最大的时候是i行；
                     j_max = i1;
                 }
                 if(sum < 0)
                 {
                     sum = 0;
                 }
             }

             for (int k = N-1;k >= 0;k--)
             {
                 d1 += line[k];
                 if (d1 > Maxd1)
                 {
                     Maxd1 = d1;
                     end2[i][i1] = k;
                 }
                 if(d1 < 0)
                 {
                     d1 = 0;
                 }
             }

         }
     }
     cout << "最大子数组为：" << endl;
     for (int k = 0;k <= i_max;k++)//输出最大子数组元素
     {
         for (int k1 = end2[i_max][j_max];k1 <= end1[i_max][j_max];k1++)
         {
                 cout << data[j_max+k][k1] << ‘\t‘;
         }
         cout << endl;
     }

     cout << endl;
     cout << "最大子数组的和为： " << MaxSum << endl;
  }