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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
#include <cstdio>
#include <algorithm>

char segments[8008];

struct MissedMeetingsCalc
{
    MissedMeetingsCalc(int allOfficeMeetings) : allOfficeMeetings_(allOfficeMeetings)
    {
    }

    void addSegmentToTravelTime(int segmentType)
    {
        switch(segmentType)
        {
            case '1':
                missedOfficeMeetingsDuringTravel++;
                break;
            case '2':
                missedOnlineMeetingsDuringTravel++;
                break;
            case '3':
                missedFreeTimeSegments++;
                break;
        }
    }

    void addSegmentToOfficeTime(int segmentType)
    {
        switch(segmentType)
        {
            case '1':
                attendedOfficeMeetings++;
                break;
            case '2':
                break;
            case '3':
                missedFreeTimeSegments++;
                break;
        }
    }

    void removeSegmentFromTravelTime(int segmentType)
    {
        switch(segmentType)
        {
            case '1':
                missedOfficeMeetingsDuringTravel--;
                break;
            case '2':
               missedOnlineMeetingsDuringTravel--;
               break;
            case '3':
                missedFreeTimeSegments--;
                break;
        }
    }

    void removeSegmentFromOfficeTime(int segmentType)
    {
        switch(segmentType)
        {
            case '1':
                attendedOfficeMeetings--;
                break;
            case '2':
                break;
            case '3':
                missedFreeTimeSegments--;
                break;
        }
    }

    int getMissedMeetings()
    {
        return missedOnlineMeetingsDuringTravel + (allOfficeMeetings_ - attendedOfficeMeetings);
    }

    int attendedOfficeMeetings = 0;
    int missedOnlineMeetingsDuringTravel = 0;
    int missedFreeTimeSegments = 0;
    int missedOfficeMeetingsDuringTravel = 0;

    int allOfficeMeetings_;
};

int main()
{
    int n, k, t;
    scanf("%d %d %d\n", &n, &k, &t);

    int officeMeetingsCounter=0;
    int onlineMeetingsCounter=0;

    for(int i=0; i<n; i++)
    {
        scanf("%c", &segments[i]);
        if( segments[i] == '1' ) officeMeetingsCounter++;
        if( segments[i] == '2' ) onlineMeetingsCounter++;
    }

    int result = -1;
    int freeTimeCounter = n - officeMeetingsCounter - onlineMeetingsCounter;
    if( officeMeetingsCounter <= k ) result = n - std::max(0, officeMeetingsCounter+onlineMeetingsCounter-k);
    else
    {
        int beginTravelToOfficeSegmentNum = 0;
        int endTravelFromOfficeSegmentNum = 2*t;

        while(beginTravelToOfficeSegmentNum <= (n-(2*t)))
        {
            MissedMeetingsCalc missedMeetingsCalc{officeMeetingsCounter};
            endTravelFromOfficeSegmentNum=beginTravelToOfficeSegmentNum+2*t;

            for(int i=0; i<2*t; i++)
            {
                missedMeetingsCalc.addSegmentToTravelTime(segments[beginTravelToOfficeSegmentNum+i]);
            }
            // move end pointer
            auto missedMeetings = missedMeetingsCalc.getMissedMeetings();
            while(endTravelFromOfficeSegmentNum <= n && missedMeetingsCalc.getMissedMeetings() > k)
            {
                missedMeetingsCalc.removeSegmentFromTravelTime(segments[endTravelFromOfficeSegmentNum-t]);
                missedMeetingsCalc.addSegmentToOfficeTime(segments[endTravelFromOfficeSegmentNum-t]);
                missedMeetingsCalc.addSegmentToTravelTime(segments[endTravelFromOfficeSegmentNum]);

                endTravelFromOfficeSegmentNum++;
                missedMeetings = missedMeetingsCalc.getMissedMeetings();
            }
            if(endTravelFromOfficeSegmentNum > n)
            {
                beginTravelToOfficeSegmentNum++;
                continue;
            }
            auto officeMeetingsUsedForCoding = officeMeetingsCounter - missedMeetingsCalc.attendedOfficeMeetings - missedMeetingsCalc.missedOfficeMeetingsDuringTravel;
            result = std::max(result, freeTimeCounter - missedMeetingsCalc.missedFreeTimeSegments + officeMeetingsUsedForCoding);

            // move begin pointer
            missedMeetingsCalc.removeSegmentFromTravelTime(beginTravelToOfficeSegmentNum);
            missedMeetingsCalc.addSegmentToTravelTime(beginTravelToOfficeSegmentNum+t);
            beginTravelToOfficeSegmentNum++;
        }
    }
    printf("%d\n", result);
}