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

int pref[9000][4]; // 1 - spotkanie w biurze;   2 - spotkanie online;    3 - brak spotkan

int f(int x, int n){
    if(x != -1) return x;
    else return n;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    string s;
    int n, k, t;
    cin >> n >> k >> t >> s;
    

    for(int i = 0; i < n; i++){
        pref[i][1] = pref[max(i - 1, 0)][1] + (s[i] == '1');
        pref[i][2] = pref[max(i - 1, 0)][2] + (s[i] == '2');
        pref[i][3] = pref[max(i - 1, 0)][3] + (s[i] == '3');
    }
    int ans = -1;
    if(pref[n - 1][1] + pref[n - 1][2] <= k){
        cout << n;
        return 0;
    }
    for(int i = 0; i < n; i++){
        for(int j = i + 2 * t; j <= n; j++){
            int opuszczone = pref[i + t - 1][1] + pref[n - 1][1] - pref[j - t - 1][1] + pref[i + t - 1][2] - pref[f(i - 1, n)][2] + pref[j - 1][2] - pref[j - t - 1][2];
            //cout << " i = " <<i << "    j = " << j << "     op = " << opuszczone << "  " << pref[i + t - 1][1] + pref[n - 1][1] - pref[j - t - 1][1] << "  +  " << pref[i + t - 1][2] - pref[f(i - 1, n)][2] + pref[j - 1][2] - pref[j - t - 1][2] << endl; 
            if(opuszczone > k) continue;
            int x = pref[n - 1][3] - pref[j - 1][3];
            if(i != 0) x += pref[i - 1][3];
            x += min((k - opuszczone), pref[f(i - 1, n)][2] + pref[n - 1][2] - pref[j - 1][2]);
            ans = max(ans, x);
            //cout << " i = " <<i << "    j = " << j << "     x = " << x << endl; 
        }
    }
    
    cout << ans << "\n";
    return 0;
}