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;
int n , k , t , w;
string s;
int tab[8005];
int pre[8005];
int dp[8005][8005][4]; // n , ile ominietych , 0 - nie jest i nie byl w pracy 1 - jest w pracy , 2 - nie jest ale byl w pracy -> ile zadan
int main()
{
    ios_base::sync_with_stdio(0);   cin.tie(0);     cout.tie(0);
    cin >> n >> k >> t >> s;
    dp[0][0][0] = 1;
    for(int i = 1 ; i <= n ; i ++)
    {
        pre[i] = pre[i - 1];
        if(s[i - 1] != '3')
            pre[i] ++;
    }
    for(int i = 1 ; i <= n ; i ++)
    {
        for(int j = 0 ; j <= k ; j ++)
        {
            if(i - t >= 0 && j + pre[i] - pre[i - t] <= k)
            {
                if(dp[i - t][j][0] != 0)
                    dp[i][j + pre[i] - pre[i - t]][1] = max(dp[i][j][1] , dp[i - t][j][0]);
                if(dp[i - t][j][1] != 0)
                    dp[i][j + pre[i] - pre[i - t]][2] = max(dp[i][j][2] , dp[i - t][j][1]);
            }
            if(s[i - 1] == '1')
            {
                if(dp[i - 1][j][0] != 0)
                    dp[i][j + 1][0] = max(dp[i][j + 1][0] , dp[i - 1][j][0] + 1);
                if(dp[i - 1][j][2] != 0)
                    dp[i][j + 1][2] = max(dp[i][j + 1][2] , dp[i - 1][j][2] + 1);
                if(dp[i - 1][j][1] != 0)
                    dp[i][j][1] = max(dp[i][j][1] , dp[i - 1][j][1]);
            }
            if(s[i - 1] == '2')
            {
                if(dp[i - 1][j][0] != 0)
                    dp[i][j + 1][0] = max(dp[i][j + 1][0] , dp[i - 1][j][0] + 1);
                if(dp[i - 1][j][0] != 0)
                    dp[i][j][0] = max(dp[i][j][0] , dp[i - 1][j][0]);
                if(dp[i - 1][j][2] != 0)
                    dp[i][j + 1][2] = max(dp[i][j + 1][2] , dp[i - 1][j][2] + 1);
                if(dp[i - 1][j][2] != 0)
                    dp[i][j][2] = max(dp[i][j][2] , dp[i - 1][j][2]);
                if(dp[i - 1][j][1] != 0)
                    dp[i][j][1] = max(dp[i][j][1] , dp[i - 1][j][1]);
            }
            if(s[i - 1] == '3')
            {
                if(dp[i - 1][j][0] != 0)
                    dp[i][j][0] = max(dp[i][j][0] , dp[i - 1][j][0] + 1);
                if(dp[i - 1][j][2] != 0)
                    dp[i][j][2] = max(dp[i][j][2] , dp[i - 1][j][2] + 1);
                if(dp[i - 1][j][1] != 0)
                    dp[i][j][1] = max(dp[i][j][1] , dp[i - 1][j][1]);
            }
            //cout << i << " " << j << " " << 0 << " " << dp[i][j][0] << "\n";
            //cout << i << " " << j << " " << 1 << " " << dp[i][j][1] << "\n";
            //cout << i << " " << j << " " << 2 << " " << dp[i][j][2] << "\n";
        }
    }
    for(int i = 0 ; i <= k ; i ++)
    {
        w = max(w , dp[n][i][0]);
        w = max(w , dp[n][i][2]);
    }
    cout << w - 1;

    return 0;
}