A one-dimensional array with N integer elements {a[0],a[1],...., a[n-1],a[n]}, which has many contiguous sub-arrays, what is the maximum value of the sum of successive sub-arrays?

1. The idea of dynamic planning to solve

  /**     * Finds the cumulative sum of the largest subsequence in the array in time complexity O (N) and/     public    static int sumnum (int[] array) {        int N = array.length;        int all = Array[n-1], start = array[n-1];        int count = 0;        for (int i = n-2; I >= 0; i--) {            if ((Start + array[i]) > Array[i]) {                start = start + Array[i];            } els e {                start = Array[i];            }            if (all < start) {all                = start;            }            count++;        }        SYSTEM.OUT.PRINTLN ("Array length:" + Array.Length + ",  time Complexity:" + count);        SYSTEM.OUT.PRINTLN ("Maximum value" + all);        return all;    }

A one-dimensional array with N integer elements {a[0],a[1],...., a[n-1],a[n]}, which has many contiguous sub-arrays, what is the maximum value of the sum of successive sub-arrays?