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
#include <bits/stdc++.h>
using namespace std;

#define st first
#define nd second

int n, k, t, res = -1;
int pref1[8003], pref2[8003], pref3[8003];
string s;

int simulate_day(int start, int end, bool work = true) {
	int res = 0;
	int remaining_skips = k;
	if (work) {
		res += pref1[start - 1];
		remaining_skips -= pref1[start + t - 1];
		remaining_skips -= pref2[start + t - 1] - pref2[start - 1];
		res += pref1[n] - pref1[end + t - 1];
		remaining_skips -= pref1[n] - pref1[end - 1];
		remaining_skips -= pref2[end + t - 1] - pref2[end - 1];
	} else {
		res += pref1[n];
		remaining_skips -= pref1[n];
	}

	if (remaining_skips < 0)
		return -1;

	if (work) {
		res += pref3[n] - (pref3[end + t - 1] - pref3[start - 1]);
		res += min(pref2[n] - (pref2[end + t - 1] - pref2[start - 1]), remaining_skips);
	} else {
		res += pref3[n] + min(pref2[n], remaining_skips);
	}
	return res;
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	cin >> n >> k >> t;
	cin >> s;
	for(int i = 0; i < n; i++) {
		pref1[i + 1] = pref1[i] + (s[i] == '1');
		pref2[i + 1] = pref2[i] + (s[i] == '2');
		pref3[i + 1] = pref3[i] + (s[i] == '3');
	}
	for (int i = 1; i <= n; i++) {
		for (int j = i + t + 1; j <= n - t + 1; j++) {
			res = max(res, simulate_day(i, j));
		}
	}
	res = max(res, simulate_day(0, 0, false));
	cout << res << endl;
}