class Solution:
    def longestOnes(self, A: List[int], K: int) -> int:

        l, r, zeros = 0, 0, 0

        res = 0
        while r < len(A):

            # print(l, r, zeros)

            res = max(res, r - l)

            if zeros < K:

                if A[r] == 0:
                    zeros += 1
                r += 1
                continue
            
            if A[r] == 1:
                r += 1
            else:

                if A[l] == 1:
                    l += 1
                else:
                    l += 1
                    zeros -= 1
        res = max(res, len(A) - l)
        return res