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

using namespace std;

typedef long long ll;
typedef unsigned int uint;

short n, k, t;
short dp1[8001][8001];
short dp2[8001][8001];
char tab[8001];
short sp[8001];

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

    cin >> n >> k >> t;
    for (int i = 0; i <= k; i++)
        dp2[0][i] = -1;

    for (int i = 1; i <= n; i++)
    {
        cin >> tab[i];
        sp[i] = sp[i-1] + (tab[i] != '3');
    }

    for (int i = 1; i <= n; i++)
    {
        char c = tab[i];
        for (int j = 0; j <= k; j++)
        {
            dp1[i][j] = -1;
            if (c == '3' && dp1[i-1][j] >= 0) dp1[i][j] = max((int)dp1[i][j], dp1[i-1][j]+1);
            else
            {
                if (j > 0 && dp1[i-1][j-1] >= 0) dp1[i][j] = max((int)dp1[i][j], dp1[i-1][j-1]+1);
                if (c == '2') dp1[i][j] = max(dp1[i][j], dp1[i-1][j]);
            }
            if (i >= t)
            {
                short suma = sp[i] - sp[i-t];
                if (j >= suma) dp1[i][j] = max(dp1[i][j], dp2[i-t][j-suma]);
            }

            dp2[i][j] = dp2[i-1][j];
            if (i >= t)
            {
                short suma = sp[i] - sp[i-t];
                if (j >= suma) dp2[i][j] = max(dp2[i][j], dp1[i-t][j-suma]);
            }
        }
    }

    /*for (int j = 0; j <= k; j++)
    {
        for (int i = 0; i <= n; i++)
            cout << dp1[i][j] << ' ';
        cout << '\n';
    }
    cout << '\n';
    for (int j = 0; j <= k; j++)
    {
        for (int i = 0; i <= n; i++)
            cout << dp2[i][j] << ' ';
        cout << '\n';
    }*/

    cout << dp1[n][k];

    return 0;
}