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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
//
#ifndef __SIZEOF_INT128__
  #define __SIZEOF_INT128__
#endif
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;
template <typename T> using oset =  tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define rep(i, p, k) for(int i(p); i < (k); ++i)
#define per(i, p, k) for(int i(p); i > (k); --i)
#define sz(x) (int)(x).size()
#define sc static_cast
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef __int128_t lll;
//#define int ll
template <typename T = int> using par = std::pair <T, T>;
#define fi first
#define se second
#define test int _number_of_tests(in()); while(_number_of_tests--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb emplace_back
struct Timer {
    string name{""};
    time_point<high_resolution_clock> end, start{high_resolution_clock::now()};
    duration<float, std::milli> dur;
    Timer() = default;
    Timer(string nm): name(nm) {}
    ~Timer() {
        end = high_resolution_clock::now(); dur= end - start;
        cout << "@" << name << "> " << dur.count() << " ms" << '\n';
    }
};
template <typename T = int> inline T in()
{
    static T x;
    std::cin >> x;
    return x;
}
std::string yn(bool b)
{
    if(b) return "YES\n";
    else return "NO\n";
}
template <typename F, typename S> std::ostream& operator<<(std::ostream& out, const std::pair <F, S>& par);
template <typename T> std::ostream& operator<< (std::ostream& out, const std::vector <T>& wek)
{
    for(const auto& i : wek)out << i << ' ';
    return out;
}
template <typename F, typename S> std::ostream& operator<<(std::ostream& out, const std::pair <F, S>& par)
{
    out << '{'<<par.first<<", "<<par.second<<"}";
    return out;
}
#define show(x) cerr << #x << " = " << x << '\n';
std::int32_t main()
{
    std::cout.tie(nullptr); //for luck
    std::cin.tie(nullptr); std::ios_base::sync_with_stdio(0);
    int n, k, t; cin >> n >> k >> t;
    vector <int> p[3];
    auto s = [&p](int j, int a, int b){
        return p[j][b] - p[j][a-1];
    };
    rep(j, 0, 3)p[j].resize(n+1);
    rep(i, 1, n+1){
        rep(j, 0, 3)p[j][i] = p[j][i-1];
        p[in<char>()-'1'][i]++;
    }
    int o(-1);
    if(p[0][n] <= k)o = p[2][n] + min(k, p[0][n]+p[1][n]);
    rep(a, t, n+1)rep(b, a+1, n+2-t){
        int m(s(0,1,a-t)+s(0,b+t,n));
        int pm(m);
        // cerr << a << '-' << b << ": " << m;
        rep(c, 0, 2)m += s(c, a-t+1, a) + s(c, b, b+t-1);
        // cerr << ' ' << m;
        if(m > k){
            // cerr << '\n';
            continue;
        }
        o = max(o, s(2,1,a-t) + s(2,b+t,n) + min(k-m, s(1,1,a-t)+s(1,b+t,n))+pm);
        // cerr << ": " << s(2,1,a-t) + s(2,b+t,n) + min(k-m, s(1,1,a-t)+s(1,b+t,n)) << '\n';
    }
    cout << o << '\n';
    return 0;
}