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 C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Diagnostics;
using System.Text;
using System.Text.RegularExpressions;
using System.Threading.Tasks;
using System.Numerics;
using System.IO;
using System.Runtime.InteropServices;
using static System.Math;
using static Math2;
using static io;
using static Utils;



public class CompetitiveProgramming
{

  public void Solve()
  {
    var o = Ints;
    var N = o[0];
    var K = o[1];
    var S = Str;
    var lis = new List<int>();
    int cnt = 0;
    int curstate = 1;

    for (int i = 0; i < N; ++i)
    {
      if (S[i] - '0' == curstate) ++cnt;
      else
      {
        lis.Add(cnt);
        curstate ^= 1;
        cnt = 1;
      }
    }
    lis.Add(cnt);
    if (lis.Count % 2 == 0) lis.Add(0);
    int range = 2 * K + 1;
    int ans = 0;
    int left = 0;
    int right = 0;
    int cur = 0;
    for (int i = 0; i < lis.Count; i += 2)
    {
      int nextl = i;
      int nextr = Min(lis.Count(), nextl + range);
      while (nextl > left)
      {
        cur -= lis[left];
        ++left;
      }
      while (nextr > right)
      {
        curstate += lis[right];
        ++right;
      }
      ans = Max(ans, cur);
    }
    Write(ans);


  }


}



public static class Graph
{
  public static long[] dijkstra(List<Tuple<long, int>>[] edge, int from, long INF = Math2.INFL)
  {
    long[] ret = Enumerable.Range(0, edge.Length).Select(_ => INF).ToArray();
    var pq = new PriorityQueue<Tuple<long, int>>((a, b) => (int)(a.Item1 - b.Item1));
    ret[from] = 0;
    pq.Enqueue(new Tuple<long, int>(0, from));
    while (pq.Count > 0)
    {
      var p = pq.Dequeue();
      var v = p.Item2;
      if (ret[v] < p.Item1) continue;
      foreach (var e in edge[v])
      {
        if (ret[e.Item2] > ret[v] + e.Item1)
        {
          ret[e.Item2] = ret[v] + e.Item1;
          pq.Enqueue(new Tuple<long, int>(ret[e.Item2], e.Item2));
        }

      }
    }
    return ret;
  }
}


public class PriorityQueue<T>
{
  List<T> _item;
  public int Count { get { return _item.Count; } }
  bool _isascend { get; set; }
  public T Peek { get { return _item[0]; } }
  Comparison<T> Comp;
  public PriorityQueue(bool IsAscend = true, IEnumerable<T> list = null) : this(Comparer<T>.Default.Compare, IsAscend, list) { }
  public PriorityQueue(Comparison<T> cmp, bool IsAscend = true, IEnumerable<T> list = null)
  {
    _item = new List<T>();
    _isascend = IsAscend;
    this.Comp = cmp;
    if (list != null)
    {
      _item.AddRange(list);
      Build();
    }
  }

  private int Compare(int i, int j) => (_isascend ? -1 : 1) * Comp(_item[i], _item[j]);
  private void Swap(int i, int j) { var t = _item[i]; _item[i] = _item[j]; _item[j] = t; }
  private int Parent(int i)
      => (i - 1) >> 1;
  private int Left(int i)
      => (i << 1) + 1;
  public T Enqueue(T val)
  {
    int i = _item.Count;
    _item.Add(val);
    while (i > 0)
    {
      int p = Parent(i);
      if (Compare(i, p) > 0)
        Swap(i, p);
      i = p;
    }
    return val;
  }
  private void Heapify(int index)
  {
    for (int i = index, j; (j = Left(i)) < _item.Count; i = j)
    {
      if (j != _item.Count - 1 && Compare(j, j + 1) < 0) j++;
      if (Compare(i, j) < 0)
        Swap(i, j);
    }
  }
  public T Dequeue()
  {
    T val = _item[0];
    _item[0] = _item[_item.Count - 1];
    _item.RemoveAt(_item.Count - 1);
    Heapify(0);
    return val;
  }
  private void Build()
  {
    for (var i = (_item.Count >> 1) - 1; i >= 0; i--)
      Heapify(i);
  }
}



public static class Math2
{
  public const int INF = 1 << 29;
  public const long INFL = 1L << 60;
  public const long MOD = 1000000007;
  public const int MOD2 = 998244353;

  public static long Power(long a, long b, long MOD = 1000000007)//i^N
  {
    long res = 1;
    while (b > 0)
    {
      if ((b & 1) != 0) res = res * a % MOD;
      a = a * a % MOD;
      b >>= 1;
    }
    return res;
  }
  public static long Power2(long a, long b)//i^N
  {
    long res = 1;
    while (b > 0)
    {
      if ((b & 1) != 0) res = res * a;
      a = a * a;
      b >>= 1;
    }
    return res;
  }
  public static long GCD(long a, long b)
  {
    while (b > 0)
    {
      var r = a % b;
      a = b;
      b = r;
    }
    return a;
  }
  public static long LCM(long a, long b) => (b / GCD(a, b)) * a;
  public static long Comb(long n, long r, int MOD = 1000000007)
  {
    long ret = 1;
    long x = 1;
    for (long i = n; i >= n - r + 1; --i)
    {
      ret = ret / x * i;
      ret %= MOD;
      x++;
    }
    return ret;
  }
  public static long Comb2(long n, long r)
  {
    long Nume = 1;
    long Deno = 1;

    if (r > n - r) r = n - r;
    for (long i = 1; i <= r; ++i)
    {
      Deno *= i;
      Nume *= n - i + 1;
    }
    return Nume / Deno;
  }
}
public static class Utils
{

  public static void Swap<T>(ref T A, ref T B)
  {
    T x = A;
    A = B;
    B = x;
  }
  public static int DigitSum(int N)
  {
    string s = N.ToString();
    int ret = 0;
    for (int i = 0; i < s.Length; ++i) ret += s[i] - '0';
    return ret;
  }
}
class Program
{
  static void Main(string[] args)
  {
    var CompetitiveProgramming = new CompetitiveProgramming();
    CompetitiveProgramming.Solve();
  }
}
public static class io
{
  public static string Str => Console.ReadLine();
  public static string[] Strs => Str.Split(' ');
  public static long[] Longs => Strs.Select(long.Parse).ToArray();
  public static int[] Ints => Strs.Select(int.Parse).ToArray();
  public static char[] Chars => Str.ToArray();
  public static double[] Doubles => Strs.Select(double.Parse).ToArray();
  public static long Long1 => Longs[0];
  public static int Int1 => Ints[0];
  public static char Char1 => Chars[0];
  public static double Double1 => Doubles[0];
  public static long[] VerticalRead(int N) { long[] A = new long[N]; for (int i = 0; i < N; ++i) A[i] = Long1; return A; }
  public static void Write(string a) => Console.WriteLine(a);
  public static void Write(params object[] i) => Write(string.Join(" ", i));
  //public static void Write<T>(IEnumerable<T> a) => Write(string.Join(" ", a));
  public static void Verticalwrite<T>(IEnumerable<T> a) { foreach (var z in a) Write(z); }
  public static void YN(bool i) { if (i) Write("Yes"); else Write("No"); }
}