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
#include <iostream>
#include <vector>

using namespace std;

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

    vector<int> dp(n + 1, -1);
    dp[0] = 0;
    int miss = 0, best = 0;

    for (int i = 0; i < n; i++) {
        if (dp[i] == -1) continue;
        if (s[i] == '3') dp[i + 1] = max(dp[i + 1], dp[i] + 1);
        else dp[i + 1] = max(dp[i + 1], dp[i]);

        if (s[i] == '1') miss++;

        if (i + t * 2 <= n && miss <= k) {
            int tmp = 0;
            for (int j = i + 1; j < i + t * 2; j++) {
                if (s[j] == '1') tmp++;
            }
            if (miss + tmp <= k) dp[i + t * 2] = max(dp[i + t * 2], dp[i]);
        }

        best = max(best, dp[i + 1]);
    }

    cout << (miss > k ? -1 : best) << endl;
}