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
// PA 2024 1B - Praca
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
	ios_base::sync_with_stdio(0);
	int n, k, t;
	int best, candidate, homeOffice, meetingsLive, meetingsOnline;
	char c;
	vector<char> plan;
	vector<int> morningMissed;
	vector<int> morningMissedMaybe;
	vector<int> eveningMissed;
	vector<int> eveningMissedMaybe;
	
	cin >> n;
	cin >> k;
	cin >> t;
	meetingsLive = 0;
	meetingsOnline = 0;
	
	for (int i = 0; i < n; ++i) {
		cin >> c;
		if (c == '1') {
			++meetingsLive;
		}
		if (c == '2') {
			++meetingsOnline;
		}
		plan.push_back(c);
		morningMissed.push_back(0);
		morningMissedMaybe.push_back(0);
		eveningMissed.push_back(0);
		eveningMissedMaybe.push_back(0);
	}
	
	//special case
	if (meetingsLive <= k) {
		if (k > meetingsLive + meetingsOnline) {
			homeOffice = 0;
		} else {
			homeOffice = meetingsLive + meetingsOnline - k;
		}
		cout << n - homeOffice << endl;
		return 0;		
	}
	
	for (int i = 0; i < t; ++i) {
		if (plan[i] == '1' || plan[i] == '2') {
			++morningMissed[0];
		}
		if (plan[n - 1 - i] == '1' || plan[n - 1 - i] == '2') {
			++eveningMissed[n - 1];
		}
	}
		
	for (int i = 1; i < n - t + 1; ++i) {
		morningMissed[i] = morningMissed[i - 1];
		morningMissedMaybe[i] = morningMissedMaybe[i - 1];
		if (plan[i - 1] == '2') {
			--morningMissed[i];
			++morningMissedMaybe[i];
		}
		if (plan[i + t - 1] == '1' || plan[i + t - 1] == '2') {
			++morningMissed[i];
		}
	}
	
	for (int i = n - 2; i >= t - 1; --i) {
		eveningMissed[i] = eveningMissed[i + 1];
		eveningMissedMaybe[i] = eveningMissedMaybe[i + 1];
		if (plan[i + 1] == '2') {
			--eveningMissed[i];
			++eveningMissedMaybe[i];
		}
		if (plan[i - t + 1] == '1' || plan[i - t + 1] == '2') {
			++eveningMissed[i];
		}
	}
	
	best = -1;
	for (int i = 0; i < n - t + 1; ++i) {
		for (int j = n - 1; j >= t - 1; --j) {
			if (i + t - 1 >= j - t + 1) {
				break;
			}
			if (morningMissed[i] + eveningMissed[j] <= k) {
				homeOffice = (morningMissedMaybe[i] + eveningMissedMaybe[j]) -
					(k - (morningMissed[i] + eveningMissed[j]));
				if (homeOffice < 0) {
					homeOffice = 0;
				}
				candidate = n - (j - i + 1) - homeOffice;
				if (candidate > best) {
					best = candidate;
				} 
			}
		}
	}
	
	cout << best << endl;	
	
	return 0;
}