求1维数组最大子段和,适合初学者，算法设计与基础，写的通俗易懂，且正确-Seeking the largest sub-segment of a one-dimensional array, suitable for beginners, algorithm design and basic written in easy to understand, and correct

题目描述：给定一个数组a[0,...,n-1],求其最大子数组(长度>=1)和 输入描述：第一行一个整数n(1<=n<=5000)，然后依次输入n个整数（每个整数范围[-5000, 5000]） 输出描述：输出一个整数表示最大子数组和 样例输入：5 1 -1 1 1 -1 样例输出：2(Topic descr iption:Given an array a[0,..., n-1], find its maximum sum of suba