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

using namespace std;

const int N=8010;

int biuro[N];
int zdalne[N];

inline int ilewB(int a,int b)
{
    return biuro[b]-biuro[a-1];
}

inline int ilewZ(int a,int b)
{
    return zdalne[b]-zdalne[a-1];
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,k,t;
    cin>>n>>k>>t;
    string S;
    cin>>S;
    int ileB=0, ileZ=0;
    for(int i = 0; i < S.size(); i ++)
    {
        if(S[i] == '1')
        {
            ileB++;
            biuro[i+1]++;
        }
        if(S[i] == '2')
        {
            ileZ++;
            zdalne[i+1]++;
        }
        zdalne[i+1]+=zdalne[i];
        biuro[i+1]+=biuro[i];
    }
    if(ileB<=k)
    {
        k-=ileB;
        ileZ = max(0, ileZ-k);
        cout<<n - ileZ<<'\n';
        return 0;
    }
    int bestres = -1;
    for(int p = 1; p <= n; p ++)
    {
        for(int d = 0; d <= n-p+1-t-t ;d ++)
        {
            int tmpk = k;
            tmpk -= ilewB(1,p+t-1) + ilewB(p+d+t, n) + ilewZ(p,p+t-1)+ilewZ(p+d+t, p+d+t+t-1);
            if(tmpk<0)
                continue;
            int tmpn = n - t - t - d;
            int wdpz = ilewZ(1,p-1) + ilewZ(p+t+t+d,n);
            wdpz = max(0,wdpz-tmpk);
            bestres=max(bestres,tmpn-wdpz);
        }
    }
    cout<<bestres<<'\n';
}