ccf201509-1 数列分段

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e3 + 10;

int x[maxn];
int main(){
	int n,ans = 1;
	
	scanf("%d",&n);
	for(int i = 0;i < n;++i)	scanf("%d",&x[i]);
	for(int i = 1;i < n;++i)	
		if(x[i] != x[i - 1])	ans++;
	printf("%d\n",ans);
	
	return 0;
}