#include <iostream>
#include <map>
#include <vector>

using namespace std;

int minSpend(vector<int>& calander) {
    int n = calander.size();
    vector<int> dp(n, 0);
    dp[0] = calander[0] == 0 ? 0 : 2;
    for (int i=1; i<n; ++i) {
        int num = calander[i] == 1 ? 2 : 0;
        int two = i>=2 ? dp[i-2] : 0;
        dp[i] = min(dp[i-1] + num, dp[i-2]+3);
    }
    return dp[n-1];
}

int main(int argc, char const *argv[])
{
    vector<int> data = {1, 0, 0,1, 1, 0, 0, 0, 1};

    cout << "res: " << minSpend(data) << endl;
    return 0;
}