Given an array A of 0s and 1s, we may change up to K values from 0 to 1.
Return the length of the longest (contiguous) subarray that contains only 1s. 
 

Example 1:
Input: A = [1,1,1,0,0,0,1,1,1,1,0], K = 2
Output: 6
Explanation: 
[1,1,1,0,0,1,1,1,1,1,1]
Bolded numbers were flipped from 0 to 1.  The longest subarray is underlined.

Example 2:
Input: A = [0,0,1,1,0,0,1,1,1,0,1,1,0,0,0,1,1,1,1], K = 3
Output: 10
Explanation: 
[0,0,1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,1,1]
Bolded numbers were flipped from 0 to 1.  The longest subarray is underlined.

 
Note:

1 <= A.length <= 20000
0 <= K <= A.length
A[i] is 0 or 1

```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 findMaxConsecutiveOnes(self, nums: List[int]) -> int:\n        if len(nums) == 0:\n            return 0 \n\n        # left - on the first 1 of the island\n        # right - on the last 1 of that island\n        left = 0\n        while left < len(nums) and nums[left] != 1:\n            left += 1\n\n        right = left \n        while right + 1 < len(nums) and nums[right + 1] == 1:\n            right += 1\n\n        if right == len(nums):\n            return 0\n\n        maxOnes = right - left + 1\n\n        while left < len(nums):\n            left = right + 1\n            while left < len(nums) and nums[left] != 1:\n                left += 1\n\n            right = left \n            while right + 1 < len(nums) and nums[right + 1] == 1:\n                right += 1\n\n            maxOnes = max(maxOnes, right - left + 1)\n\n        return maxOnes\n    \n    \n    def longestOnes(self, A: List[int], K: int) -> int:\n        if K == 0:\n            return self.findMaxConsecutiveOnes(A)\n        \n        if len(A) == 0:\n            return 0\n\n        left, right = 0, 0\n\n        # Pre-condition: In the [left, right] we have exactly K zeros,\n        # and you can't move right any more\n\n        # Move right to K-th zero\n        if A[right] == 0:\n            K -= 1\n        while right + 1 < len(A) and K > 0:\n            right += 1\n            if A[right] == 0:\n                K -= 1\n\n        # Move more if there are 1s to the right of K-th zero    \n        while right + 1 < len(A) and A[right + 1] == 1:\n            right += 1\n\n        maxSize = right - left + 1\n\n        while right < len(A):\n            # Move left off of a zero, and then move right accordingly to include 1 more zero\n            while left < len(A) and A[left] != 0:\n                left += 1\n            if left < len(A):\n                left += 1\n            else:\n                return maxSize\n\n\n            # Move right to include one more zero   \n            right += 1\n            while right + 1 < len(A) and A[right + 1] == 1:\n                right += 1\n\n            maxSize = max(maxSize, right - left + 1)\n            \n        return maxSize "
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'longestOnes'
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: 6268