The development of software engineering pair The sum of 3 consecutive maximal sub-arrays in one or more arrays

First, the topic requirements

Title: Returns the and of the largest sub-array in an integer array. Requirements: Enter an array of shapes, with positive numbers in the array and negative values. One or more consecutive integers in an array make up a sub-array, each of which has a and. If the array a[0] ... A[j-1] next to each other, allowing a[i-1], ... A[n-1], a[0] ... A[J-1] and the largest. Returns the position of the largest subarray at the same time. The maximum value for the and of all sub-arrays. Requires a time complexity of O (n). Second, the design thought three, code four or five, summary six, the work photograph

The development of software engineering pair The sum of 3 consecutive maximal sub-arrays in one or more arrays