0%

# Problem

Given a circular array C of integers represented by A, find the maximum possible sum of a non-empty subarray of C.

Here, a circular array means the end of the array connects to the beginning of the array.  (Formally, C[i] = A[i] when 0 <= i < A.length, and C[i+A.length] = C[i] when i >= 0.)

Also, a subarray may only include each element of the fixed buffer A at most once.  (Formally, for a subarray $$C[i], C[i+1], ..., C[j]$$, there does not exist $$i <= k_1, k_2 <= j$$ with$k_1 mod A.length = k_2 mod A.length$.)

Example 1:

Example 2:

Example 3:

Example 4:

Example 5:

## Notes

1. $$-30000 <= A[i] <= 30000$$
2. $$1 <= A.length <= 30000$$