谁都会做系列
#include<iostream>
#include<string.h>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
int main(){
int n ,segs = 0,pre = -1,curr=0;
cin >> n;
vector<int> a;
for(int i = 0; i < n; i++){
cin >> curr;
if(curr!=pre){
segs++;
}
pre = curr;
}
cout << segs;
return 0;
}