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
//Sylwia Sapkowska 
#include <bits/stdc++.h> 
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

typedef pair<int, int> T;
const int oo2 = 1e9+7;

void solve(){
    int n, k, t; cin >> n >> k >> t;
    string s; cin >> s;
    s = "#" + s;
    vector pref(n+1, vector<int>(4));
    for (int i = 1; i<=n; i++){
        pref[i] = pref[i-1];
        pref[i][s[i]-'0']++;
    }
    int ans = -1;
    //caly dzien w domu - opuszcza spotkania w biurze tylko
    if (pref[n][1] <= k){
        // w trakcie spotkan w biurze bedzie robil zadania, reszte dopycha spotkaniami zdalnymi
        ans = max(ans, pref[n][3] + pref[n][1] + min(k-pref[n][1], pref[n][2]));
    }
    for (int l = 1; l + 2 * t <= n; l++){
        for (int r = l+t; r + t - 1 <= n; r++){
            // w drodze do pracy opuszczone
            int opuszczone = 2 * t - (pref[l+t-1][3] - pref[l-1][3] + pref[r+t-1][3] - pref[r-1][3]); //+1 i 2 na przedziale [l, l+t-1], [r, r+t-1]
            opuszczone += pref[l-1][1] + pref[n][1] - pref[r+t-1][1]; //1 na przedziale [1, l-1], [r+t, n]
            // spotkania w domu zdalne
            int spotkania = pref[l-1][2] + pref[n][2] - pref[r+t-1][2];
            int wolne = l + n - r - t - spotkania;
            if (opuszczone <= k){
                ans = max(ans, wolne + min(spotkania, k-opuszczone));
            }
        }
    }
    cout << ans << "\n";
}
 
int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    //cin >> t;
    while (t--) solve();

    return 0;
}