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
63
64
65
66
#include <bits/stdc++.h>
using namespace std;
#define fwd(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) fwd(i, 0, n)
#define all(X) X.begin(), X.end()
#define sz(X) int(size(X))
#define pb push_back
#define eb emplace_back
#define st first
#define nd second
using pii = pair<int, int>; using vi = vector<int>;
using ll = long long; using ld = long double;
#ifdef LOC
auto SS = signal(6, [](int) { *(int *)0 = 0; });
#define DTP(x, y) auto operator << (auto &o, auto a) -> decltype(y, o) { o << "("; x; return o << ")"; }
DTP(o << a.st << ", " << a.nd, a.nd);
DTP(for (auto i : a) o << i << ", ", all(a));
void dump(auto... x) { (( cerr << x << ", " ), ...) <<
'\n'; }
#define deb(x...) cerr << setw(4) << __LINE__ << ":[" #x "]: ", dump(x)
#else
#define deb(...) 0
#endif
 

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, k, t; cin >> n >> k >> t;
    string str; cin >> str;
    vector<int> normal(n+1, 0);
    vector<int> remote(n+1, 0);
    rep(i, n){
        normal[i+1] = normal[i];
        remote[i+1] = remote[i];
        if(str[i] == '1'){
            normal[i+1]++;
        }else if(str[i] == '2'){
            remote[i+1]++;
        }
    }
    deb(normal);
    deb(remote);
    int res = -1;
    for(int i = 0; i + 2 * t <= n; i++){
        for(int j = i + t; j + t <= n; j++){
            int missed = 0;
            missed += (remote[i + t] - remote[i]) + (remote[j + t] - remote[j]);
            missed += normal[i+t] + (normal[n] - normal[j]);
            deb(i, j, missed);
            if(missed > k)continue;
            int rem = remote[i] + (remote[n] - remote[j+t]);
            rem -= k - missed;
            rem = max(rem, 0);
            res = max(res, i + n - j - t - rem);
        }  
    }
    if(normal[n] <= k){
        int rem = remote[n];
        rem -= (k - normal[n]);
        rem = max(rem, 0);
        res = max(res, n - rem);
    }
    cout << res << "\n";
    return 0;
}