CCF sequence segmentation (Full Score code + problem solving idea) 201509 -1

Title Description

Their thinking

When in an array The current number is different from the previous one , Add one to the number of paragraphs , So when you enter an array , Accumulated number of segments according to special judgment

Code implementation

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 1010;

int a[N];

int main()
{
    
    int n;
    cin >> n;

    int res = 1;
    for (int i = 0; i < n; i ++)
    {
    
        cin >> a[i];
        if (i && a[i] != a[i - 1]) res ++; // When the number is not a[0] And the number is not equal to the previous number , Add one to the number of paragraphs 
    }

    cout << res;
    return 0;
}