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
#include <iostream>
using namespace std;

int P[8000+5][4];

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

	int n, k, t;
	string D;
	
	cin >> n >> k >> t >> D;
	
	for(int i=1; i<=n; i++){
		P[i][1] = P[i-1][1];
		P[i][2] = P[i-1][2];
		P[i][3] = P[i-1][3];
		
		P[i][(D[i-1]-'0')]++;
		
		
		//cout << P[i][1] << ' ' << P[i][2] << ' ' << P[i][3] << '\n';
	}
	
	int w = -1;
	
	for(int i=1; i<=n-t*2+1; i++){
		for(int j=i+t; j<=n-t+1; j++){
			int stra = (P[i+t-1][1] + P[n][1]-P[j-1][1]) + (P[i+t-1][2]-P[i-1][2] + P[j+t-1][2]-P[j-1][2]);
			int opcj = (P[i-1][2] + P[n][2]-P[j+t-1][2]);
			int pzad = (P[i-1][3] + P[n][3]-P[j+t-1][3]) + (P[i-1][1] + P[n][1]-P[j+t-1][1]);
			
			if(stra == k){
				w = max(w, pzad);
				//cout << "= ";
			}else if(stra < k){
				w = max(w, pzad+min(k-stra, opcj));
				//cout << "< ";
			}/*else{
				cout << "> ";
			}*/
			
			//cout << i << ' ' << j << "   ";
			//cout << stra << ' ' << opcj << ' ' << pzad << "  " << w << '\n';
		}
	}
	
	int stra = (P[n][1]);
	int opcj = (P[n][2]);
	int pzad = (P[n][3] + P[n][1]);
	
	if(stra == k){
		w = max(w, pzad);
	}else if(stra < k){
		w = max(w, pzad+min(k-stra, opcj));
	}
	
	//cout << stra << ' ' << opcj << ' ' << pzad << "  " << w << '\n';
	cout << w;
	return 0;
}