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
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
#include <bits/stdc++.h>
using namespace std;

int main()
{
    // ios_base::sync_with_stdio(0);
    // cin.tie(0);
    // cout.tie(0);

    int n, k, t;
    cin >> n >> k >> t;

    vector<int> a(n + 1, 0);
    vector<vector<int>> pref(n, vector<int>(5, 0));
    vector<vector<int>> suf(n, vector<int>(5, 0));

    for (int i = 0; i < n; i++)
    {
        char x;
        cin >> x;
        a[i] = x - '0';

        pref[i][a[i]]++;
        suf[i][a[i]]++;
    }

    for (int i = 1; i < n; i++)
    {
        for (int j = 1; j <= 3; j++)
        {
            pref[i][j] += pref[i - 1][j];
        }
    }

    for (int i = n - 2; i >= 0; i--)
    {
        for (int j = 1; j <= 3; j++)
        {
            suf[i][j] += suf[i + 1][j];
        }
    }

    // Check for no office
    if (pref[n - 1][1] <= k)
    {
        int sum = pref[n - 1][3];
        sum += pref[n - 1][1];
        sum += min(k - pref[n - 1][1], pref[n - 1][2]);
        cout << sum << "\n";
        return 0;
    }

    int mx = -1;
    for (int i = 0; i < n - 2 * t + 1; i++)
    {
        for (int j = i + 2 * t - 1; j < n; j++)
        {
            int sum = 0;
            int dropped = 0;

            // Skipped while driving
            dropped += pref[i + t - 1][1] - (i - 1 >= 0 ? pref[i - 1][1] : 0);
            dropped += pref[i + t - 1][2] - (i - 1 >= 0 ? pref[i - 1][2] : 0);

            dropped += pref[j][1] - pref[j - t][1];
            dropped += pref[j][2] - pref[j - t][2];

            if (dropped > k)
                continue;

            if (i - 1 >= 0)
            {
                sum += pref[i - 1][3];
                sum += pref[i - 1][1];

                dropped += pref[i - 1][1];
            }

            if (j < n - 1)
            {
                sum += suf[j + 1][3];
                sum += suf[j + 1][1];

                dropped += suf[j + 1][1];
            }

            int left = k - dropped;

            if (left < 0)
                continue;

            if (i - 1 >= 0)
            {
                sum += min(left, pref[i + t - 1][2] - pref[i - 1][2]);
                left -= min(left, pref[i + t - 1][2] - pref[i - 1][2]);
            }

            if (j < n - 1)
            {
                sum += min(left, pref[j][2] - pref[j - t][2]);
            }

            mx = max(mx, sum);
        }
    }

    cout << mx << "\n";
}