Maximum array overflow problem for pair development

First, the requirements

1. Title:

Returns the and of the largest sub-array in an integer array.

2. Requirements:

Requires that the program must be able to handle 1000 elements; Each element is of type int32; Enter an array of shapes with positive and negative numbers in the array. One or more consecutive integers in an array make up a sub-array, each of which has a and. The maximum value for the and of all sub-arrays. Requires a time complexity of O (n). Second, the design idea three, the code four, the experiment Five, summarizes

Maximum array overflow problem for pair development