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
#include <string>
#include <vector>

using namespace std;

#include <string>
#include <vector>

using namespace std;

int solution(vector<int> ingredient) {
    int answer = 0;
    vector<int> hamburger = { 1,2,3,1 };
    vector<int> packaged;
    int i = 0; int start = ingredient.size();
    int n = 0; vector < int > select;
    for (int i = 0; i < ingredient.size(); i++)
    {
        if (ingredient[i] == 1 && start > i)
        {
            start = i;
        }
        if (ingredient[i] == -1)
            continue;
        if (ingredient[i] == hamburger[n])
        {
            n++;
            select.push_back(i);
        }
        else
        {
            n = 0;
            select.clear();
            if (ingredient[i] == hamburger[n])
            {
                n++;
                select.push_back(i);
            }
        }
        if (n == 4)
        {

            for (int j = 0; j < select.size(); j++)
            {
                ingredient[select[j]] = -1;

            }
            select.clear();
            answer++;
            i = start-1;
            n = 0;
        }
    }


    return answer;
}