Please answer question in C++

7 Sequence segments Given n > 0 and a sequence of n integers (e.g. from an input stream), print how many segments composed by consecutive copies of the same number the sequence has. Examples: The sequence 1 2 2 3 4 4 4 4 5 5 has 5 segments. The sequence 6 6 6 6 6 6 6 6 5 5 5 5 5 5 5 0 0 0 9 has 4 segments. The sequence 1 2 3 4 2 3 4 5 3 4 5 6 1 2 3 has 15 segments