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

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<long long, long long> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;

#define Size(x) (int)x.size()
#define VAR(v,n) auto v = (n)
#define FOR(i,a,b) for(VAR(i,a); i < (b); ++i)
#define FORE(i,a,b) for(VAR(i,a); i <= (b); ++i)
#define FORREV(i,a,b) for(VAR(i,b); i >= (a); --i)
#define FORSTEP(i,a,b,step) for(VAR(i,a); i < (b); i += (step))
#define FOREACH(i,c) for(auto i : (c))
#define FOREACHS(i,c,n) for(VAR(i,&(c)[0]); i-(c)<(n); ++i)
#define ALL(x) x.begin(),x.end()
#define CLEAR(t) memset(t, 0, sizeof(t))
#define F first
#define S second
#define MP make_pair
#define PUB push_back
#define POB pop_back
#define pieprzu ios_base::sync_with_stdio(0);

const int    INF = 1000000001;
const double EPS = 10e-9;

const int MAXN = 8000;

const char MEETING_OFFICE = '1';
const char MEETING_REMOTE = '2';
const char FREE_TIME = '3';

char input[MAXN + 5];

int officeMeetings[MAXN + 5];
int remoteMeetings[MAXN + 5];

void rob(int test) {
    int n, maxMeetingsToSkip, travelTime;
    scanf("%d %d %d", &n, &maxMeetingsToSkip, &travelTime);
    scanf("%s", input);

    FOR (i, 0, n) {
        if (i > 0) {
            officeMeetings[i] = officeMeetings[i - 1];
            remoteMeetings[i] = remoteMeetings[i - 1];
        }

        if (input[i] == MEETING_OFFICE) {
            ++officeMeetings[i];
        }

        if (input[i] == MEETING_REMOTE) {
            ++remoteMeetings[i];
        }
    }

    // stays home
    if (officeMeetings[n - 1] <= maxMeetingsToSkip) {
        printf("%d\n", min(n - (officeMeetings[n - 1] + remoteMeetings[n - 1] - maxMeetingsToSkip), n));
        return;
    }

    // needs to go to the office
    // 012345
    // 0ttxtt
    int bestResult = -1;
    FORE (startTravelToOffice, 0, n - 2 * travelTime - 1) {
        FORE (startTravelToHome, startTravelToOffice + travelTime + 1, n - travelTime) {
            int skippedOfficeMeetingsBeforeGettingToOffice = officeMeetings[startTravelToOffice + travelTime - 1];
            int skippedOfficeMeetingsAfterLeavingOffice = officeMeetings[n - 1] - officeMeetings[startTravelToHome - 1];
            int skippedOfficeMeetings = skippedOfficeMeetingsBeforeGettingToOffice + skippedOfficeMeetingsAfterLeavingOffice;

            int skippedRemoteMeetingsWhileGoingToOffice = remoteMeetings[startTravelToOffice + travelTime - 1] - remoteMeetings[startTravelToOffice - 1];
            int skippedRemoteMeetingsWhileGoingToHome = remoteMeetings[startTravelToHome + travelTime - 1] - remoteMeetings[startTravelToHome - 1];
            int skippedRemoteMeetings = skippedRemoteMeetingsWhileGoingToOffice + skippedRemoteMeetingsWhileGoingToHome;

            int skippedMeetings = skippedOfficeMeetings + skippedRemoteMeetings;

            if (skippedMeetings <= maxMeetingsToSkip) {
                int totalTravelTime = 2 * travelTime;
                int officeTime = startTravelToHome - startTravelToOffice - travelTime;

                int meetingsToSkipLeft = maxMeetingsToSkip - skippedMeetings;
                int meetingsInHomeBeforeGoingToOffice = 0;
                if (startTravelToOffice > 0) {
                    meetingsInHomeBeforeGoingToOffice = remoteMeetings[startTravelToOffice - 1];
                }
                int meetingsInHomeAfterGettingBackFromOffice = remoteMeetings[n - 1] - remoteMeetings[startTravelToHome + travelTime - 1];
                int meetingsInHome = max(meetingsInHomeBeforeGoingToOffice + meetingsInHomeAfterGettingBackFromOffice - meetingsToSkipLeft, 0);

                bestResult = max(bestResult, n - totalTravelTime - officeTime - meetingsInHome);
            }
        }
    }

    printf("%d\n", bestResult);
}

int main() {
    int test = 1;
    //scanf("%d", &test);

    FORE (i, 1, test) rob(i);

    return 0;
}