SRM477 Div2 Easy(250) VacationTime

VacationTime

#include <iostream>
#include <vector>
#include <numeric>

using namespace std;

class VacationTime
{
public:
    int bestSchedule( int N, int K, vector <int> workingDays );
};

int VacationTime::bestSchedule( int N, int K, vector <int> workingDays )
{
    vector<int> day( N );
    for ( int i=0; i<(int)workingDays.size(); i++ )
        day[workingDays[i]-1] = 1;

    int ans = K;
    for ( int i=0; i<=N-K; i++ )
        ans = min( ans, accumulate(day.begin()+i,day.begin()+i+K,0) );
    return ans;
}