101432: [AtCoder]ABC143 C - Slimes

Memory Limit：256 MB Time Limit：2 S
Judge Style：Text Compare Creator：
Submit：0 Solved：0

Description

Score : $300$ points

Problem Statement

There are $N$ slimes lining up from left to right. The colors of these slimes will be given as a string $S$ of length $N$ consisting of lowercase English letters. The $i$-th slime from the left has the color that corresponds to the $i$-th character of $S$.

Adjacent slimes with the same color will fuse into one larger slime without changing the color. If there were a slime adjacent to this group of slimes before fusion, that slime is now adjacent to the new larger slime.

Ultimately, how many slimes will be there?

Constraints

  • $1 \leq N \leq 10^5$
  • $|S| = N$
  • $S$ consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:

$N$
$S$

Output

Print the final number of slimes.

Sample Input 1

10
aabbbbaaca

Sample Output 1

5

Ultimately, these slimes will fuse into abaca.

Sample Input 2

5
aaaaa

Sample Output 2

1

All the slimes will fuse into one.

Sample Input 3

20
xxzaffeeeeddfkkkkllq

Sample Output 3

10

Input

题意翻译

【问题描述】 有$N$个史莱姆从左到右排列。这些史莱姆的颜色将以只由小写英文字母的字符串$S$给出。第$i$个史莱姆的颜色是字符串$S$的第$i$位。 具有相同颜色的相邻的史莱姆将融合为一个更大的史莱姆，而不会更改颜色。如果在融合之前这组史莱姆旁边有其他史莱姆，那么旁边的史莱姆现在就与新的更大的史莱姆相邻。 最终，会有多少史莱姆？ 【输入格式】 输入第一行一个整数$N$，表示史莱姆的个数。 第二行一个字符串$S$，表示史莱姆的颜色。 【输出格式】 输出一个整数，表示最终会有多少史莱姆。 【样例说明】 样例$1$：最终，这些史莱姆将融合为`abaca`。 样例$2$：所有的史莱姆将融合为一个。 【数据规模与约定】 对于$100%$的数据，$1\leq N\leq 10^5，|S|=N$。 感谢@[Celtic](https://www.luogu.com.cn/user/176990)提供的翻译。

Source/Category

加入题单

算法标签：