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
#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x),end(x)
#define pb push_back
#define st first
#define nd second

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

const int INF = 2e9;
const ll LLINF = 2e18;

void solve()
{
    int n,k,t;
    cin>>n>>k>>t;
    string s;
    cin>>s;

    vector<vi> pref(2,vi(n+1,0));
    vi meets(n+1,0);
    for(int i=0; i<n; ++i)
    {
        pref[0][i+1]=pref[0][i];
        pref[1][i+1]=pref[1][i];
        if(s[i]!='3')
            ++pref[s[i]-'1'][i+1];
        meets[i+1]=pref[0][i+1]+pref[1][i+1];
    }

    if(pref[0][n]<=k)
    {
        int to_attend = max(0,meets[n]-k);
        cout<<n-to_attend<<endl;
        return;
    }

    int res=-1;
    for(int i=0; i<=n-2*t; ++i)
        for(int j=i+t; j<=n-t; ++j)
        {
            int skipped = meets[i+t]-meets[i]+meets[j+t]-meets[j]+pref[0][i]+pref[0][n]-pref[0][j+t];
            if(skipped<=k)
            {
                int to_attend_at_home = max(0,meets[n]-k-(meets[j]-meets[i+t]));
                res = max(res,n-(j+t-i)-to_attend_at_home);
            }
        }
    cout<<res<<endl;
}

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int z=1;
    //cin>>z;
    while(z--)
        solve();
    return 0;
}