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
#include "bits/stdc++.h"

#define meow main

using namespace std;

struct pref_sum {
  vector<int> ins;

  pref_sum(vector<char> s) {
    ins.resize(s.size() + 1);
    ins[0] = 0;
    for (int i = 0; i < s.size(); i++)
      ins[i + 1] = ins[i] + s[i];
  }

  int ask(int l, int r) {
    if (l > r)
      return 0;

    return ins[r + 1] - ins[l];
  }
};

signed meow() {
  cin.tie((ostream *)!ios::sync_with_stdio(false));
  int n, k, t;
  cin >> n >> k >> t;
  vector<vector<char>> jobs(3, vector<char>(n));
  for (int i=0; i<n; i++) {
    char x;
    cin >> x;
    jobs[x - '1'][i]++;
  }

  pref_sum _1(jobs[0]);
  pref_sum _2(jobs[1]);
  pref_sum _3(jobs[2]);

  int res = -1;
  for (int i = 0; i < n; i++) {
    for (int j = i + t; j + t < n; j++) {
      int missed = _1.ask(0, i+t-1) + _1.ask(j + 1, n - 1) + _2.ask(i, i+t-1) + _2.ask(j+1, j+t);
      if (missed <= k) {
        res = max(res, min(k - missed, _2.ask(0, n - 1) - _2.ask(i, j+t)) + _3.ask(0, n - 1) - _3.ask(i, j+t) + _1.ask(0, n - 1) - _1.ask(i, j+t));
      }
    }
  }

  int missed = _1.ask(0, n-1);
  if(missed <= k) {
    res = max(res, missed + _3.ask(0, n - 1) + min(k-missed, _2.ask(0, n-1)));
  }
  cout << res << '\n';
}