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
80
81
82
83
84
85
86
87
88
89
#include <iostream>

using namespace std;

int n, k, t;
string s;
int best = -1;

int getMeetingSum(int i, int n);
int getRemoteSum(int i, int n);

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

    cin >> n >> k >> t;
    cin >> s;
    int a=0, b, c;
    int meetings = getMeetingSum(0, n);
    int minReq = meetings - k;
    if(minReq < 0) {
        minReq = 0;
    }
    int lena;
    int lenc;

    for(int i = 0; i <= n - 2 * t - 1; i++) {
        lena = i;
        if (i - 1 >= 0) {
            if(s[i-1] == '2') {
                a++;
            }
        }
        b = 0;
        c = getRemoteSum(i + 2 * t, n);
        for(int j = i + t + 1; j <= n - t; j++) {
            if(s[j-1] <= '2') {
                b++;
            }
            if(s[j+t-1] == '2') {
                c--;
            }
            lenc = n - j - t;
            if(b >= minReq) {
                if(lena + lenc > best) {
                    best = lena + lenc;
                }
            } else {
                if (a + b + c >= minReq) {
                    int kkk = minReq - b;
                    if (lena + lenc - kkk > best) {
                        best = lena + lenc - kkk;
                    }
                }
            }
        }
    }

    int remote = getRemoteSum(0, n);
    if(remote >= minReq) {
        if(n - minReq > best) {
            best = n - minReq;
        }
    }

    cout << best << '\n';

    return 0;
}

int getRemoteSum(int from, int to) {
    int res = 0;
    for(int i = from; i < to; i++) {
        if(s[i] == '2') {
            res++;
        }
    }
    return res;
}

int getMeetingSum(int from, int to) {
    int res = 0;
    for(int i = from; i < to; i++) {
        if(s[i] <= '2') {
            res++;
        }
    }
    return res;
}