返回一个整数循环数组中最大子数组的和

#include
#define n 100
using namespace std;
void main()
{
    int a[n], b[n][n];
    int length, i, j, w = 0, p = 0, q = 0, temp, m;
    cout <<"输入整数数组" <> a[length];
        length++;
        if (getchar() == '\n')
        {
            break;
        }
    }
    cout <<"这个整数数组的长度为：" <length - 1)
            {
                m = 0;
            }
            j++;
        }
    }
 
    temp = b[0][0];
    for (i = 0; itemp)
            {
                temp = b[i][j];
                p = i;
                q = j;
            }
        }
    }
 
    cout <<"最大子数组的值为：" <= length)
        {
            p = 0;
        }
        i++;
    }
 
    cout <