2015年ccf计算机职业认证资格考试第一题数列分段

// luogu-judger-enable-o2
#include<bits/stdc++.h>
#include<unordered_set>
#define rg register ll
#define inf 2147483647
#define min(a,b) (a<b?a:b)
#define max(a,b) (a>b?a:b)
#define ll long long
#define maxn 200005
const double eps = 1e-8;
using namespace std;
inline ll read()
{
	char ch = getchar(); ll s = 0, w = 1;
	while (ch < 48 || ch>57) { if (ch == '-')w = -1; ch = getchar(); }
	while (ch >= 48 && ch <= 57) { s = (s << 1) + (s << 3) + (ch ^ 48); ch = getchar(); }
	return s * w;
}
inline void write(ll x)
{
	if (x < 0)putchar('-'), x = -x;
	if (x > 9)write(x / 10);
	putchar(x % 10 + 48);
}
ll a[maxn],ans;
int main()
{
	ll n=read();
	for(rg i=1;i<=n;i++)
    {
        a[i]=read();
    }
    for(rg i=1;i<=n;i++)
    {
        rg j=i;
        while(a[j]==a[i]&&j<=n)j++;
        i=j-1,ans++;
    }
    cout<<ans<<endl;
	return 0;
}