Submission #6028227

---

Source Code Expand

// {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
// }}}

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;

static constexpr int mod = (int)1e9 + 7;
static constexpr int inf = 100100100;
static constexpr ll linf = 1e18;
static constexpr double eps = 1e-9;
static constexpr double pi = 3.14159265359;

#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rrep(i, n) for (ll i = n; i >= 0; --i)
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#define pb push_back
#define ist insert
#define fst first
#define snd second


int main() {
    // cin.tie(0);
    // ios_base::sync_with_stdio(false);
    ll N, K;
    cin >> N >> K;
    string S;
    cin >> S;

    vector<ll> I;
    char b = S[0];
    I.pb(0);
    rep (i, N) {
        if (b != S[i]) {
            b = S[i];
            I.pb(i);
        }
    }
    I.pb(N);

    ll ans = 0;
    rep (i, I.size()) {
        if (S[I[i]] == '0') {
            ans = max(ans, I[min((ll)I.size() - 1, i + 2 * K)] - I[i]);
        } else {
            ans = max(ans, I[min((ll)I.size() - 1, i + 2 * K + 1)] - I[i]);
        }
    }
    cout << ans << endl;
}

Submission Info

Judge Result