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

using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, k, t, best = -1, current = 0, counter = 0;
    string plan;
    cin >> n >> k >> t >> plan;
    for (int i = 0; i < n; i++) {
        counter += (plan[i] == '1');
        current += (plan[i] == '3');
    }
    if (counter <= k) {
        cout << min(n, current + k - counter) << "\n";
        return 0;
    }
    for (int p = t; p < n - t; p++) {
        current = 0;
        counter = 0;
        for (int i = 0; i < n; i++) {
            if (i < p || i > p) counter += (plan[i] == '1');
            if ((i >= p - t - 1 && i < p) || (i > p && i <= p + t))
                counter += (plan[i] == '2');
            if (i < p - t || i > p + t) current += (plan[i] != '2');
        }
        if (counter <= k) {
            best = max(best, min(n, current + k - counter));
        }
        for (int kon = p + 1; kon < n - t; kon++) {
            if (plan[kon] != '3') counter--;
            if (plan[kon + t] == '3')
                current--;
            else
                counter++;
            if (counter <= k) {
                best = max(best, min(n, current + k - counter));
            }
        }
    }
    cout << best << "\n";
    return 0;
}