One array of the largest and

Topic:

Enter an array of integers with positive and negative numbers in the array. One or more consecutive integers in an array make up a sub-array.

The maximum value for the and of all sub-arrays. The required time is O (n).

Analysis: The sum is summed from the first position, and the result is negative when you discard the preceding summation and recalculation.

Static int Maxsum (intint  n) {        int currentsum = arr[0];         int ans = currentsum;          for (int i = 1; i < n; i++) {            = Math.max (currentsum + arr[i], arr[i]);             = Math.max (ans, currentsum);        }         return ans;    }

One array of the largest and