Problem:
Score : 400 points

Problem Statement

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.

Constraints

N is an integer satisfying 1 \leq N \leq 10^5.

K is an integer satisfying 1 \leq K \leq 10^5.

The length of the string S is N.

Each character of the string S is 0 or 1.

Input

Input is given from Standard Input in the following format:

N K
S

Output

Print the maximum possible number of consecutive people standing on hands after at most K directions.

Sample Input 1

5 1
00010

Sample Output 1

4

We can have four consecutive people standing on hands, which is the maximum result, by giving the following direction:

Give the direction with l = 1, r = 3, which flips the first, second and third persons from the left.

Sample Input 2

14 2
11101010110011

Sample Output 2

8

Sample Input 3

1 1
1

Sample Output 3

1

No directions are necessary.

Solution in Rust (1.15.1) (judge verdict: Runtime Error)

use std::cmp::max;
#[allow(unused_macros)]
macro_rules! scan {
    () => {
        {
            let mut line: String = String::new();
            std::io::stdin().read_line(&mut line).unwrap();
            line.trim().to_string()
        }
    };
    (;;) => {
        {
            let mut line: String = String::new();
            std::io::stdin().read_line(&mut line).unwrap();
            line.trim().split_whitespace().map(|s| s.to_string()).collect::<Vec<String>>()
        }
    };
    (;;$n:expr) => {
        {
            (0..$n).map(|_| scan!()).collect::<Vec<_>>()
        }
    };
    ($t:ty) => {
        {
            let mut line: String = String::new();
            std::io::stdin().read_line(&mut line).unwrap();
            line.trim().parse::<$t>().unwrap()
        }
    };
    ($($t:ty),*) => {
        {
            let mut line: String = String::new();
            std::io::stdin().read_line(&mut line).unwrap();
            let mut iter = line.split_whitespace();
            (
                $(iter.next().unwrap().parse::<$t>().unwrap(),)*
            )
        }
    };
    ($t:ty;;) => {
        {
            let mut line: String = String::new();
            std::io::stdin().read_line(&mut line).unwrap();
            line.split_whitespace()
                .map(|t| t.parse::<$t>().unwrap())
                .collect::<Vec<_>>()
        }
    };
    ($t:ty;;$n:expr) => {
        (0..$n).map(|_| scan!($t;;)).collect::<Vec<_>>()
    };
    ($t:ty; $n:expr) => {
        (0..$n).map(|_|
                    scan!($t)
        ).collect::<Vec<_>>()
    };
    ($($t:ty),*; $n:expr) => {
        (0..$n).map(|_|
                    scan!($($t),*)
        ).collect::<Vec<_>>()
    };
}

fn main() {
    let (n, k) = scan!(usize, usize);
    let s = scan!();

    if s.chars().all(|c| c == '1') || s.chars().all(|c| c == '0') {
        println!("{}", n);
        return;
    }

    let v0 = s
        .split('1')
        .map(|s| s.len())
        .filter(|&n| n > 0)
        .collect::<Vec<_>>();
    let v1 = s
        .split('0')
        .map(|s| s.len())
        .filter(|&n| n > 0)
        .collect::<Vec<_>>();

    let mut nums = vec![];
    let mut sums = vec![];
    if s.chars().nth(0).unwrap() == '0' {
        for i in 0..max(v0.len(), v1.len()) {
            if i < v0.len() {
                nums.push(v0[i])
            }
            if i < v1.len() {
                nums.push(v1[i])
            }
        }
        sums.push(nums.iter().take(k * 2).sum::<usize>());
        nums = nums.into_iter().skip(1).collect::<Vec<_>>();
    } else {
        for i in 0..max(v0.len(), v1.len()) {
            if i < v1.len() {
                nums.push(v1[i])
            }
            if i < v0.len() {
                nums.push(v0[i])
            }
        }
    }

    let mut num = nums.iter().take(2 * k + 1).sum::<usize>();
    sums.push(num);
    let mut i = 0;
    loop {
        num -= nums[i] + nums[i + 1];
        num += nums[2 * k + 1 + i]
            + if 2 * k + 1 + i + 1 < nums.len() {
                nums[2 * k + 1 + i + 1]
            } else {
                0
            };
        sums.push(num);
        i += 2;
        if 2 * k + 1 + i >= nums.len() {
            break;
        }
    }
    println!("{}", sums.iter().max().unwrap());
}