*7-1 CCF 2015-09-1 sequence segmentation

Title Description

Source code

#include<iostream>
using namespace std;
int main()
{
    
	int n, last, current, sum=0;
	cin >> n; 
	cin >> last;
	sum = 1;
	for (int i = 1; i < n; i++)
	{
    
		cin >> current;
		if (last != current) sum++;
		last = current;
	}
	cout << sum << endl;
	return 0;
}

About this problem

First number It must take some time Each subsequent number is different from the previous number Order sum++