AtCoder Regular Contest 113
翻译中…
Problem Statement
翻译中…
Given is a string $S$ of length $N$. Let $s_i$ denote the $i$-th character of $S$. Find the maximum number of times the following operation can be done.
翻译中…
- Choose three consecutive characters in
$S$,$s_i,s_{i+1},s_{i+2}\quad (1\leq i\leq |S|-2)$, such that$s_i=s_{i+1}\neq s_{i+2}$, and replace$s_{i+2}$with$s_i$.
翻译中…
Constraints
翻译中…
$3 \leq |S| \leq 2\times 10^5$$S$consists of lowercase English letters.
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
S翻译中…
Output
翻译中…
Print the maximum number of times the operation can be done.
翻译中…
样例
Input #1
accept
Output #1
3
We can do the operation three times, as follows:
- do it with $i=2$, changing the string to `acccpt`;
- do it with $i=3$, changing the string to `acccct`;
- do it with $i=4$, changing the string to `accccc`.
Input #2
atcoder
Output #2
0
Input #3
anerroroccurred
Output #3
16
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。