Problem: N people are arranged in a row from left to right.  You are given a string S of length N consisting of `0` and `1`, and a positive integer K.  The i-th person from the left is standing on feet if the i-th character of S is `0`, and standing on hands if that character is `1`.  You will give the following direction at most K times (possibly zero):  **Direction** : Choose integers l and r satisfying 1 \leq l \leq r \leq N, and flip the l-th, (l+1)-th, ..., and r-th persons. That is, for each i = l, l+1, ..., r, the i-th person from the left now stands on hands if he/she was standing on feet, and stands on feet if he/she was standing on hands.  Find the maximum possible number of **consecutive** people standing on hands after at most K directions.

Submission attempts (in order):
def main():
    n, k = [int(i) for i in input().split()]
    s = [int(i) for i in list(input())]
    table = []
    now = 1
    cnt = 0
    for i in range(n):
        if s[i] == now:
            cnt += 1
        else:
            table.append(cnt)
            cnt = 1
            now ^= 1 
    if cnt != 0:
        table.append(cnt)
    if len(table)%2 == 0:
        
        table.append(0)
    ans = 0
    l = 0
    d = min(len(table), 2*k+1)
    r = l + d
    tmp = sum(table[l:r])
    while r <= len(table):
        ans = max(ans, tmp)
        if l < len(table):
            tmp -= table[l]
        l += 1
        if l < len(table):
            tmp -= table[l]
        l += 1
        r += 1
        if r <= len(table):
            tmp += table[r-1]
        r += 1
        if r <= len(table):
            tmp += table[r-1]
    print(ans)


if __name__ == '__main__':

def main():
    n, k = [int(i) for i in input().split()]
    s = [int(i) for i in list(input())]
    table = []
    now = 1
    cnt = 0
    for i in range(n):
        if s[i] == now:
            cnt += 1
        else:
            table.append(cnt)
            cnt = 1
            now ^= 1 
    if cnt != 0:
        table.append(cnt)
    if len(table)%2 == 0:
        
        table.append(0)
    ans = 0
    l, r = 0, 2*k+1
    if r > len(table):
        ans = max(ans, sum(table))
    while r < n:
        ans = max(sum(table[l: r+1]), ans)
        l, r = l + 2, r + 2
    print(ans)


if __name__ == '__main__':
    main()

def main():
    n, k = [int(i) for i in input().split()]
    s = [int(i) for i in list(input())]
    table = []
    now = 1
    cnt = 0
    for i in range(n):
        if s[i] == now:
            cnt += 1
        else:
            table.append(cnt)
            cnt = 1
            now ^= 1 
    if cnt != 0:
        table.append(cnt)
    if len(table)%2 == 0:
        
        table.append(0)
    ans = 0
    l, r = 0, min(len(table)-1, 2*k+1)
    while r < len(table):
        ans = max(ans, sum(table[l:r+1]))
        l += 2
        r += 2
    print(ans)


if __name__ == '__main__':
    main()

def main():
    n, k = [int(i) for i in input().split()]
    s = [int(i) for i in list(input())]
    table = []
    now = 1
    cnt = 0
    for i in range(n):
        if s[i] == now:
            cnt += 1
        else:
            table.append(cnt)
            cnt = 1
            now ^= 1 
    if cnt != 0:
        table.append(cnt)
    if len(table)%2 == 0:
        
        table.append(0)
    ans = 0
    l, r = 0, min(len(table)-1, 2*k+1)
    while r < len(table):
        ans = max(ans, sum(table[:r+1]))
        l += 2
        r += 2
    print(ans)


if __name__ == '__main__':
    main()

def main():
    n, k = [int(i) for i in input().split()]
    s = [int(i) for i in list(input())]
    table = []
    now = 1
    cnt = 0
    for i in range(n):
        if s[i] == now:
            cnt += 1
        else:
            table.append(cnt)
            cnt = 1
            now ^= 1 
    if cnt != 0:
        table.append(cnt)
    if len(table)%2 == 0:
        
        table.append(0)
    ans = 0
    l = 0
    d = min(len(table), 2*k+1)
    r = l + d
    tmp = sum(table[l:r])
    while r <= len(table):
        ans = max(ans, tmp)
        if l < len(table):
            tmp -= table[l]
        l += 1
        if l < len(table):
            tmp -= table[l]
        l += 1
        r += 1
        if r <= len(table):
            tmp += table[r-1]
        r += 1
        if r <= len(table):
            tmp += table[r-1]
    print(ans)


if __name__ == '__main__':
    main()

Verdicts: Runtime Error

Wrong Answer

Wrong Answer

Wrong Answer

Accepted