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

#define all(x) begin(x), end(x)
#define st first
#define nd second

typedef long long ll;
typedef pair<int,int> pii;

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n,k,t;
    cin>>n>>k>>t;
    string s;
    cin>>s;
    vector<ll>a(n+1);
    vector<ll>b(n+1);
    vector<ll>c(n+1);
    for(int i=0;i<n;i++)
    {
        a[i+1]=a[i];
        b[i+1]=b[i];
        c[i+1]=c[i];
        if(s[i]=='1')a[i+1]++;
        if(s[i]=='2')b[i+1]++;
        if(s[i]=='3')c[i+1]++;
    }
    k=b[n]+a[n]-k;
    ll wyn=-1;
    for(int i=1;i<n+1;i++)
    {
        for(int j=i+2*t-1;j<n+1;j++)
        {
            ll w=k-(a[j-t]-a[i+t-1])-(b[j-t]-b[i+t-1]);
            ll x=c[i-1]+(c[n]-c[j])+a[i-1]+a[n]-a[j];
            ll y=b[i-1]+(b[n]-b[j]);
           // cout<<i<<" "<<j<<" "<<x<<" "<<y<<" "<<w<<endl;
            if(w<=y)
            {
                wyn=max(wyn,x+(y-w));
            }
        }
    }
    cout<<wyn<<endl;
}