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: Wrong Answer)

use std::io::*;
use std::str::FromStr;

pub fn read<T: FromStr>() -> T {
  let stdin = stdin();
  let stdin = stdin.lock();
  let token: String = stdin
    .bytes()
    .map(|c| c.expect("failed to read char") as char)
    .skip_while(|c| c.is_whitespace())
    .take_while(|c| !c.is_whitespace())
    .collect();
  token.parse().ok().expect("failed to parse token")
}

use std::cmp::{max, min};

fn main() {
  let n = read::<i64>();
  let k = read::<i64>();
  let mut sum_s = vec![];
  let s = read::<String>();

  // 連続数で配列
  let mut now = '1';
  let mut cnt = 0;
  for i in s.chars() {
    if i != now {
      sum_s.push(cnt);
      cnt = 1;
      now = if now == '1' { '0' } else { '1' }
    } else {
      cnt += 1;
    }
  }
  sum_s.push(cnt);
  if sum_s.len() % 2 == 0 {
    sum_s.push(0);
  }

  let length = (k * 2 + 1) as usize;
  let sum_len = sum_s.len() as i64;
  let mut ans = 0;
  let mut block = 0;
  for i in 0..min(length as i64, sum_len) {
    block += sum_s[i as usize];
  }

  ans = block;

  for i in 0..sum_len - length as i64 {
    if i % 2 == 1 {
      continue;
    }
    let i_size = i as usize;
    println!("i: {}", i);
    let block_f = sum_s[i_size];
    let block_s = sum_s[i_size + 1];

    let block_n = sum_s[i_size + length];
    let block_n2 = sum_s[i_size + 1 + length];

    // println!(
    //   "first: {}, second: {}, last1: {}, last2: {}",
    //   block_f, block_s, block_n, block_n2
    // );
    block += block_n + block_n2 - block_s - block_f;
    // println!("block: {}", block);
    ans = max(ans, block)
  }
  println!("{}", ans);

}