Two-dimensional arrays

#include <iostream>

using namespace Std;

int Zuida (int n,int a[],int *sm,int *mm);

void Main ()

{

int m,n,i,j,sm,mm,t2;

int Sum,max;

int up[100],down[100],t[100];

int a[100][100],b[100];

cout<< "Enter rows for two-dimensional arrays" <<endl;

cin>>m;

cout<< "Enter rows for two-dimensional arrays" <<endl;

cin>>n;

for (i=0;i<m;i++)

{

for (j=0;j<n;j++)

{

cin>>a[i][j];

}

}

for (i=0;i<m;i++)

{

for (j=0;j<n;j++)

{

B[J]=A[I][J];

}

Sum=zuida (N,B,&SM,&MM);

Up[i]=sma;

down[i]=mm;

T[i]=sum;

}

T2=T[0];

for (i=0;i+1<m;i++)

{

if (up[i]<=down[i+1] && down[i]>=up[i+1])

{

T2+=T[I+1];

}

for (j=up[i];j<up[i+1];j++)

{

if (a[i+1][j]>0) t2+=a[i+1][j]; Distinguishing independent positive numbers

}

}

cout<<t2<<endl;

}

int Zuida (int n,int a[],int *sm,int *mm)

{

int b[100]={0};

int i,sum1=0,max1=0;

for (i=0;i<n;i++)

{

if (sum1<0)

{

Sum1=a[i];

}

Else

{

Sum1=sum1+a[i];

}

B[I]=SUM1;

}

MAX1=B[0];

for (i=0;i<n;i++)

{

if (Max1<b[i])

{

Max1= B[i];

*mm = i;

}

}

for (i = *mm;i >= 0;i--)

{

if (b[i] = = A[i])

{

*sm= i;

Break

}

}

return max1;

}

I am mainly responsible for the code writing, audit by Zhang Zixua completed

Two-dimensional arrays