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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define fi first
#define sn second

typedef long long ll;
typedef vector<int> VI;
typedef vector<char> VC;
typedef pair<int, int> PI;

const int M_OFFICE = 1;
const int M_REMOTE = 2;
const int NOOP = 3;

const bool DEBUG = false;

vector<int> preffixes[4];

int h_in_place(int p, int q, int place, int n) {
  if (p < 0 || q < p || p > n || q > n) return 0;

  return preffixes[place][q] - preffixes[place][p - 1];
}

int main() {
  int n, k, t;
  cin >> n >> k >> t;

  int res = -1;

  vector<int> a(n);

  preffixes[M_OFFICE] = vector<int>(n + 2);
  preffixes[M_REMOTE] = vector<int>(n + 2);
  preffixes[NOOP] = vector<int>(n + 2);

  preffixes[M_OFFICE][0] = preffixes[M_REMOTE][0] = preffixes[NOOP][0] = 0;

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

    preffixes[M_OFFICE][i + 1] = preffixes[M_OFFICE][i];
    preffixes[M_REMOTE][i + 1] = preffixes[M_REMOTE][i];
    preffixes[NOOP][i + 1] = preffixes[NOOP][i];

    preffixes[a[i]][i + 1]++;
  }

  preffixes[M_OFFICE][n + 1] = preffixes[M_OFFICE][n];
  preffixes[M_REMOTE][n + 1] = preffixes[M_REMOTE][n];
  preffixes[NOOP][n + 1] = preffixes[NOOP][n];

  if (DEBUG) {
    for (int i = 0; i <= n + 1; i++) {
      cout << i << " ";
    }
    cout << endl;

    cout << "  ";
    for (int i = 0; i < n; i++) {
      cout << a[i] << " ";
    }
    cout << endl;

    for (int j = 1; j < 4; j++) {
      for (int i = 0; i <= n + 1; i++) {
        cout << preffixes[j][i] << " ";
      }
      cout << endl;
    }
  }

  int missed_office_inhome, missed_in_commute, noops, potyczki, kk, available;

  missed_office_inhome = h_in_place(1, n, M_OFFICE, n);
  noops = h_in_place(1, n, NOOP, n);
  available = h_in_place(1, n, M_REMOTE, n);
  potyczki = noops + missed_office_inhome;

  kk = k - missed_office_inhome;

  if (kk >= 0) {
    potyczki += min(kk, available);
    res = max(res, potyczki);
  }

  for (int p = 1; p <= n; p++) {
    if (p - t <= 0) continue;

    for (int q = p; q <= n; q++) {
      if (q + t >= n + 1) break;

      missed_office_inhome = h_in_place(1, p - t - 1, M_OFFICE, n) +
                             h_in_place(q + t + 1, n, M_OFFICE, n);

      missed_in_commute = h_in_place(p - t, p - 1, M_OFFICE, n) +
                          h_in_place(p - t, p - 1, M_REMOTE, n) +
                          h_in_place(q + 1, q + t, M_OFFICE, n) +
                          h_in_place(q + 1, q + t, M_REMOTE, n);

      // exclude (p,q)
      noops = h_in_place(1, p - t - 1, NOOP, n) + h_in_place(q + t + 1, n, NOOP, n);

      potyczki = noops + missed_office_inhome;

      kk = k;
      kk -= missed_office_inhome;
      kk -= missed_in_commute;

      available = h_in_place(1, p - t - 1, M_REMOTE, n) +
                  h_in_place(q + t + 1, n, M_REMOTE, n);

      potyczki += min(kk, available);

      if (DEBUG) {
        cout << "p: " << p << " q: " << q << " k: " << kk
             << " potyczki: " << potyczki << endl;
        cout << "\tinhome: " << missed_office_inhome << endl;
        cout << "\tcommute: " << missed_in_commute << endl;
        cout << "\tnoops: " << noops << endl;
      }

      if (kk < 0) continue;
      //   cout << kk << endl;
      //

      //   cout<<"\t"<<missed_office_inhome<<" "<<missed_in_commute<<"
      //   "<<noops<<endl; cout<<"\tp - t - 1: "<<p - t - 1<<" q + t + 1: "<<q +
      //   t + 1<<endl;

      // + in_place(p, q, M_REMOTE, n) + in_place(p, q, M_OFFICE, n);
      res = max(res, potyczki);
      //   cout << "\t" << available << " " << potyczki << " " << res << endl;
    }
  }

  cout << res << endl;

  return 0;
}