Given an integer array nums and an integer k, return the maximum sum of a non-empty subsequence of that array such that for every two consecutive integers in the subsequence, nums[i] and nums[j], where i < j, the condition j - i <= k is satisfied.
A subsequence of an array is obtained by deleting some number of elements (can be zero) from the array, leaving the remaining elements in their original order.
 
Example 1:
Input: nums = [10,2,-10,5,20], k = 2
Output: 37
Explanation: The subsequence is [10, 2, 5, 20].

Example 2:
Input: nums = [-1,-2,-3], k = 1
Output: -1
Explanation: The subsequence must be non-empty, so we choose the largest number.

Example 3:
Input: nums = [10,-2,-10,-5,20], k = 2
Output: 23
Explanation: The subsequence is [10, -2, -5, 20].

 
Constraints:

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

```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 constrainedSubsetSum(self, nums: List[int], k: int) -> int:\n        maxNum = nums[0]\n        maxSum = nums[0]\n        maxNegSum = 0\n        curNegWindowSum = 0\n        curWindowSum = 0\n        rightIndex = 0 \n        leftIndex = 0\n        midIndex = 0\n        negativeStreak = False\n        \n        while rightIndex < len(nums):\n            if maxNum < nums[rightIndex]:\n                maxNum = nums[rightIndex]\n                \n            if nums[rightIndex] >= 0 and not negativeStreak: \n                curWindowSum += nums[rightIndex]\n                maxSum = max(maxSum, curWindowSum)\n            elif nums[rightIndex] < 0 and not negativeStreak:\n                negativeStreak = True\n                midIndex = rightIndex\n                if k > 1:\n                    curNegWindowSum = nums[rightIndex]\n                    maxNegSum = curNegWindowSum\n                curWindowSum += nums[rightIndex]\n            elif nums[rightIndex] < 0 and negativeStreak:\n                if rightIndex - midIndex < k - 1:\n                    curNegWindowSum += nums[rightIndex]\n                    maxNegSum = curNegWindowSum\n                else:\n                    if k > 1:\n                        curNegWindowSum -= nums[midIndex]\n                        curNegWindowSum += nums[rightIndex]\n                    maxNegSum = min(maxNegSum, curNegWindowSum)\n                    midIndex += 1\n                curWindowSum += nums[rightIndex]\n            elif nums[rightIndex] >= 0 and negativeStreak:\n                curWindowSum -= maxNegSum\n                if curWindowSum <= 0:\n                    midIndex = rightIndex\n                    leftIndex = rightIndex\n                    curWindowSum = nums[rightIndex]\n                else:\n                    curWindowSum += nums[rightIndex]\n                maxSum = max(maxSum, curWindowSum)\n                maxNegSum = 0\n                curNegWindowSum = 0\n                negativeStreak = False\n            \n            rightIndex += 1\n        return max(maxSum, maxNum)\n            \n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'constrainedSubsetSum'
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: 6060