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 = '### I was thinking about prefix sum direction and try to figure out relationship between current number and previous number\n\n\n### besides dynamic programming, is there another way of doing it?????\n\n\n### good dynamic programming in here https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/discuss/819432/Python-Easy-to-understand-DP\n# dp[i][0] : max length of subarray ending with index i With positive product   \n# dp[i][1] : max length of subarray ending with index i With negative product \n\n\nclass Solution:\n    def getMaxLen(self, nums: List[int]) -> int:\n        dp = [[0,0] for _ in range(len(nums))]\n        res = 0\n        if nums[0] > 0:\n            dp[0][0] = 1\n        elif nums[0] < 0:\n            dp[0][1] = 1\n        #print(dp)\n        res = max(res, dp[0][0])\n        for idx in range(1, len(nums)):\n            if nums[idx] == 0:\n                dp[idx][0], dp[idx][1] = 0, 0\n            elif nums[idx] > 0:\n                dp[idx][0] = dp[idx-1][0] + 1\n                if dp[idx-1][1] > 0:  ### be careful about this condition, if dp[idx-1][0] = 0, it means that at previous index there is no subarray\'s product that is less than 0, I get stuck in here for some time ..... \n                    dp[idx][1] = dp[idx-1][1] + 1\n                res = max(dp[idx][0], res)\n            \n            elif nums[idx] < 0:\n                dp[idx][1] = dp[idx-1][0]+1\n                if dp[idx-1][1] > 0:  ### be careful about this condition, if dp[idx-1][0] = 0, it means that at previous index there is no subarray\'s product that is less than 0\n                    dp[idx][0] = dp[idx-1][1]+1\n                res = max(res, dp[idx][0])\n                \n        #print(dp)\n        return res\n\n\n\n\'\'\'\nclass Solution:\n    def getMaxLen(self, nums: List[int]) -> int:\n        diction = {}\n        diction[\\"pos\\"], diction[\\"neg\\"] = 0, 0\n        prevpos, prevneg = 0, 0\n        res = 0\n        for num in nums:\n            if num == 0:\n                diction[\\"pos\\"], diction[\\"neg\\"] = 0, 0\n                prevpos, prevneg = 0, 0\n            elif num > 0:\n                diction[\\"pos\\"] += 1\n                if diction[\\"neg\\"] % 2 == 0:\n                    res = max(res, diction[\\"pos\\"]+diction[\\"neg\\"]+prevpos)\n                    print(num, res)\n                else:\n                    res = max(res, diction[\\"pos\\"], prevpos)\n        \n            elif num < 0:\n                diction[\\"neg\\"] += 1\n                print(\\"neg\\", num, diction[\\"neg\\"], diction[\\"pos\\"], prevpos)\n                if diction[\\"neg\\"] % 2 == 1:\n                    res = max(res, diction[\\"pos\\"])\n                    prevpos += diction[\\"pos\\"]\n                    diction[\\"pos\\"] = 0\n                else:\n                    res = max(res, diction[\\"pos\\"]+diction[\\"neg\\"]+prevpos)\n                    prevpos = diction[\\"neg\\"] + diction[\\"pos\\"] + prevpos\n                    diction[\\"neg\\"] = 0\n                    diction[\\"pos\\"] = 0\n                    \n        print(res)\n        return res\n\'\'\'\n\n        \n\'\'\'\n        diction = {}\n        diction[\\"pos\\"], diction[\\"neg\\"] = 0, 0\n        res = 0\n        for num in nums:\n            if num == 0:\n                diction[\\"pos\\"], diction[\\"neg\\"] = 0, 0\n            elif num > 0:\n                diction[\\"pos\\"] += 1\n                if diction[\\"neg\\"] % 2 == 0:\n                    res = max(res, diction[\\"pos\\"]+diction[\\"neg\\"])\n            elif num < 0:\n                diction[\\"neg\\"] += 1\n                \n                if diction[\\"neg\\"] % 2 == 1:\n                    res = max(res, diction[\\"pos\\"]+diction[\\"neg\\"]-1)\n                else:\n                    res = max(res, diction[\\"pos\\"]+diction[\\"neg\\"])\n                \n        print(res)\n        \n        return res\n        \n\n\'\'\'\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: 6360