Given an array of integers nums, find the maximum length of a subarray where the product of all its elements is positive.
A subarray of an array is a consecutive sequence of zero or more values taken out of that array.
Return the maximum length of a subarray with positive product.
 
Example 1:
Input: nums = [1,-2,-3,4]
Output: 4
Explanation: The array nums already has a positive product of 24.

Example 2:
Input: nums = [0,1,-2,-3,-4]
Output: 3
Explanation: 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'll make the product 0 which is not positive.
Example 3:
Input: nums = [-1,-2,-3,0,1]
Output: 2
Explanation: The longest subarray with positive product is [-1,-2] or [-2,-3].

Example 4:
Input: nums = [-1,2]
Output: 1

Example 5:
Input: nums = [1,2,3,5,-6,4,0,10]
Output: 4

 
Constraints:

1 <= nums.length <= 10^5
-10^9 <= nums[i] <= 10^9

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'class Solution:\n    def getMaxLen(self, nums: List[int]) -> int:\n        \n        # The approach below is the dynamic programming approach, which is actually easy!\n        # The approach after it is the one I initially tried to work out, looking at figuring\n        # out the first negative number after a zero, etc. Too complicated!\n        \n        dp = [(0,0)] # Use dy prog - dp[i] gives pair of longest pos, longest neg ending at that index.\n        if nums[0] < 0:\n            dp[0] = (0, 1)\n        elif nums[0] > 0:\n            dp[0] = (1, 0)\n        for i in range(1, len(nums)):\n            if nums[i] == 0:\n                dp.append((0,0))\n            elif nums[i] > 0:\n                if nums[i-1] != 0:\n                    if dp[i-1][1] != 0:\n                        dp.append((dp[i-1][0]+1, dp[i-1][1]+1))\n                    else:\n                        dp.append((dp[i-1][0]+1, 0))\n                else:\n                    dp.append((1, 0)) \n            elif nums[i] < 0:\n                if nums[i-1] != 0:\n                    if dp[i-1][1] != 0:\n                        dp.append((dp[i-1][1] + 1, dp[i-1][0] + 1))\n                    else:\n                        dp.append((0, dp[i-1][0] + 1))\n                else:\n                    dp.append((0, 1))\n        positives = [dp[i][0] for i in range(len(nums))]\n        #print(dp)\n        #print(positives)\n        return max(positives)\n        \n        # Below is my initial approach, which works, but is too complicated.\n        \n        maxProd = 0\n        for i in range(len(nums)):\n            if nums[i] > 0:\n                maxProd = 1\n        prods = [nums[0]]\n        zeroFound = [False] * len(nums)\n        if nums[0] == 0:\n            zeroFound[0] = True\n        for i in range(1, len(nums)):\n            if zeroFound[i-1] or nums[i] == 0:\n                zeroFound[i] = True\n        mostRecentPostZeroNeg = [float(\'-inf\')]* len(nums)\n        if nums[0] < 0:\n            mostRecentPostZeroNeg[0] = 0\n        for i in range(1, len(nums)):\n            if nums[i] == 0:\n                continue\n            if nums[i] > 0:\n                mostRecentPostZeroNeg[i] = mostRecentPostZeroNeg[i-1]\n            if nums[i] < 0:\n                if mostRecentPostZeroNeg[i-1] == float(\'-inf\'): #and zeroFound[i-1] == True:\n                    mostRecentPostZeroNeg[i] = i\n                else:\n                    mostRecentPostZeroNeg[i] = mostRecentPostZeroNeg[i-1]\n        for i in range(1, len(nums)):\n            if prods[i-1] == 0:\n                if nums[i] > 0:\n                    prods.append(1)\n                elif nums[i] < 0:\n                    prods.append(-1)\n                else:\n                    prods.append(0)\n            elif prods[i-1] < 0:\n                if nums[i] < 0:\n                    prods.append(1)\n                elif nums[i] > 0:\n                    prods.append(-1)\n                else:\n                    prods.append(0)\n            elif prods[i-1] > 0:\n                if nums[i] < 0:\n                    prods.append(-1)\n                elif nums[i] > 0:\n                    prods.append(1)\n                else:\n                    prods.append(0)\n           \n        dp = [] # count since last zero\n        if nums[0] == 0:\n            dp.append(0)\n        if nums[0] < 0:\n            dp.append(1)\n        if nums[0] > 0:\n            dp.append(1)\n        dp1 = [] # count since First negative number that followed a zero\n        if nums[0] < 0:\n            dp1.append(0)\n        if nums[0] > 0:\n            dp1.append(0)\n        if nums[0] == 0:\n            dp1.append(0)\n        for i in range(1, len(nums)):\n            if dp1[-1] == 0: # we haven\'t yet seen a post-zero negative number\n                if nums[i] < 0:\n                    dp1.append(1)\n                else:\n                    dp1.append(0)\n            else: # we have seen a post-zero negative number; increase count by 1 unless nums[i] is zero\n                if nums[i] == 0:\n                    dp1.append(0)\n                else:\n                    dp1.append(dp1[-1]+1)\n                \n        #print(dp1)\n        #print(\\"len of dp1 is \\", len(dp1))\n            \n            \n            \n        for i in range(1, len(nums)):\n            if nums[i] != 0:\n                dp.append(dp[i-1]+1)\n            else:\n                dp.append(0)\n            if prods[i] > 0:\n                maxProd = max(maxProd, dp[i])\n            else:\n                #print(\\"i is \\",i)\n                if mostRecentPostZeroNeg[i] != float(\'-inf\'):\n                    maxProd = max(maxProd, i - mostRecentPostZeroNeg[i])\n                #maxProd = max(maxProd, dp1[i]-1)\n        #print(\\"dp is \\", dp)\n        #print(\\"dp1 is \\", dp1)\n        #print(\\"zeroFound\\", zeroFound)\n        #print(\\"mostRecentPost \\", mostRecentPostZeroNeg)\n        #print(\\"prods are \\", prods)\n        return maxProd\n        \n        \n        \n        \n        \'\'\'if all(i == 0 for i in nums):\n            return 0\n        if len(nums) == 1:\n            if nums[0] < 0:\n                return 0\n        dp = []\n        if nums[0] == 0:\n            dp.append((0,0))\n        elif nums[0] > 0:\n            dp.append((1,0))\n        elif nums[0] < 0:\n            dp.append((0,1))\n        for i in range(1, len(nums)):\n            if nums[i] == 0:\n                dp.append((0,0))\n            elif nums[i] > 0:\n                dp.append((dp[i-1][0]+1, dp[i-1][1]))\n            else:\n                dp.append((dp[i-1][0], dp[i-1][1]+1))\n        print(dp)\n        maxV = 0\n        for i in range(len(dp)):\n            if dp[i][1] % 2 == 0:\n                maxV = max(maxV, dp[i][0] + dp[i][1])\n        return maxV\'\'\'\n        \n        \n        \n        \'\'\'dp = []\n        if nums[0] <= 0:\n            dp.append(0)\n        else:\n            dp.append(1)\n        for i in range(1, len(nums)):\n            if nums[i] == 0:\n                dp.append(0)\n            elif nums[i] < 0:\n                if dp[i-1] == 0:\n                    dp.append(0)\n                elif nums[i-1] < 0:\n                    dp.append()\n                else:\n                    dp.append(dp[-1]+1)\n            else: # nums[i] > 0\n                if dp[i-1] == 0:\n                    if nums[i-1] == 0:\n                        dp.append(1)\n                    else:\n                        dp.append(1)\n                elif nums[i-1] < 0:\n                    dp.append(dp[i-1] + 1)\n                else: # nums[i-1] > 0\n                    dp.append(dp[i-1] + 1)\n            \n            \n        return dp[len(nums)-1]\'\'\'\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'getMaxLen'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 6512