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
67
68
69
70
71
72
73
74
75
76
77
78
79
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;

int calc(vector<int> &v1, vector<int> &v2, vector<int> &v3, int n, int k, int t) {
    int meeting_office_missed = v1[n - 1] - v1[0];
    if (meeting_office_missed > k) {
        return -1;
    }

    int free_time = v3[n - 1] - v3[0];    
    int meeting_remote = v2[n - 1] - v2[0];    

    return free_time + min(meeting_office_missed + meeting_remote, k);
}

int calc(vector<int> &v1, vector<int> &v2, vector<int> &v3, int n, int k, int t, int i, int j) {
    int travel = 0;
    travel += v1[i + t - 1] - v1[i - 1];
    travel += v2[i + t - 1] - v2[i - 1];
    travel += v1[j + t - 1] - v1[j - 1];
    travel += v2[j + t - 1] - v2[j - 1];
    
    int meeting_office_missed = 0;
    meeting_office_missed += v1[i - 1] - v1[0];
    meeting_office_missed += v1[n - 1] - v1[j + t - 1];
    
    int missed_total = travel + meeting_office_missed;
    if (missed_total > k) {
        return -1;
    }
    
    int free_time = 0;
    free_time += v3[i - 1] - v3[0];
    free_time += v3[n - 1] - v3[j + t - 1];
    
    int meeting_remote = 0;
    meeting_remote += v2[i - 1] - v2[0];
    meeting_remote += v2[n - 1] - v2[j + t - 1];

    return free_time + meeting_office_missed + min(meeting_remote, k - missed_total);
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, k, t;
    cin >> n >> k >> t;

    string s;
    cin >> s;
    s = "0" + s + "0";

    n += 2;
    vector<int> v1(n), v2(n), v3(n);
    for (int i = 1; i < n; i++) {
        v1[i] = v1[i - 1];
        v2[i] = v2[i - 1];
        v3[i] = v3[i - 1];
        if (s[i] == '1') v1[i]++;
        if (s[i] == '2') v2[i]++;
        if (s[i] == '3') v3[i]++;
    }

    int best = -1;
    for (int i = 1; i < n - 2 * t; i++) {
        for (int j = i + t; j < n - t; j++) {
            best = max(best, calc(v1, v2, v3, n, k, t, i, j));
        }        
    }
    best = max(best, calc(v1, v2, v3, n, k, t));

    cout << best << endl;

    return 0;
}