1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#include "bits/stdc++.h"
using namespace std;

#define rep(i, b, e) for(int i = (b); i <= (e); i++)
#define per(i, b, e) for(int i = (e); i >= (b); i--)
#define FOR(i, b, e) rep(i, b, (e) - 1)
#define SZ(x) int(x.size())
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;

auto &operator<<(auto &o, pair<auto, auto> p) {
    return o << "(" << p.st << ", " << p.nd << ")"; }
auto operator<<(auto &o, auto x)->decltype(end(x), o) {
    o << "{"; int i=0; for(auto e: x) o << ", " + 2*!i++ << e;
    return o << "}"; }
#ifdef LOCAL
#define deb(x...) cerr << "[" #x "]: ", [](auto...$) { \
    ((cerr << $ << "; "),...) << endl; }(x)
#else
#define deb(...)
#endif

void solve() {
    int n, k, t;
    string s;
    cin >> n >> k >> t >> s;
    vector pref(n + 1, vector(3, 0));
    FOR(i, 0, n) FOR(j, 0, 3) pref[i + 1][j] = pref[i][j] + (s[i] == j + '1');
    auto sum = [&](int l, int r, int tp) {
        return pref[r][tp] - pref[l][tp];
    };
    int ans = [&]() {
        int skip = k - sum(0, n, 0);
        if(skip < 0) return -1;
        int wolne = sum(0, n, 0) + sum(0, n, 2);
        int zdalnyDom = sum(0, n, 1);
        return wolne + min(skip, zdalnyDom);
    }();
    FOR(i, 0, n) FOR(j, i + t, n - t + 1) {
        int skip = k - sum(0, i + t, 0) - sum(j, n, 0);
        skip = skip - sum(i, i + t, 1) - sum(j, j + t, 1);
        if(skip < 0) continue;
        int wolne = sum(0, i, 0) + sum(0, i, 2) + sum(j + t, n, 0) + sum(j + t, n, 2);
        int zdalnyDom = sum(0, i, 1) + sum(j + t, n, 1);
        ans = max(ans, wolne + min(skip, zdalnyDom));
    }
    cout << ans << '\n';
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int tt = 1;
    // cin >> tt;
    FOR(te, 0, tt) solve();
    return 0;
}