<p>Given an array of integers <code>nums</code>, find the maximum length of a subarray where the product of all its elements is positive.</p>

<p>A subarray of an array is a consecutive sequence of zero or more values taken out of that array.</p>

<p>Return <em>the maximum length of a subarray with positive product</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,-2,-3,4]
<strong>Output:</strong> 4
<strong>Explanation:</strong> The array nums already has a positive product of 24.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [0,1,-2,-3,-4]
<strong>Output:</strong> 3
<strong>Explanation:</strong> The longest subarray with positive product is [1,-2,-3] which has a product of 6.
Notice that we cannot include 0 in the subarray since that&#39;ll make the product 0 which is not positive.</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> nums = [-1,-2,-3,0,1]
<strong>Output:</strong> 2
<strong>Explanation:</strong> The longest subarray with positive product is [-1,-2] or [-2,-3].
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>-10<sup>9</sup> &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution:
    def getMaxLen(self, nums: List[int]) -> int:
        zeros = [-1]
        for i, num in enumerate(nums):
            if num == 0:
                zeros.append(i)
        zeros.append(len(nums))
        max_length = 0
        for i in range(1, len(zeros)):
            segment_start = zeros[i-1]+1
            segment_end = zeros[i]-1
            pos = True
            first_neg = -1
            last_neg = segment_end+1
            for j in range(segment_start, segment_end+1):
                if nums[j] < 0:
                    if first_neg == -1:
                        first_neg = j
                    last_neg = j
                    pos = not pos
            seg_length = 0
            print(segment_end, segment_start, first_neg, last_neg)
            if pos:
                seg_length = segment_end-segment_start + 1
            else:
                seg_length = max(segment_end-first_neg, last_neg-segment_start)
            if seg_length>max_length:
                max_length=seg_length
        return max_length
            

31600