CF2178B.Impost or Sus

A string $w$ consisting of lowercase Latin letters is called suspicious if and only if all of the following conditions hold:

• The letter $\mathtt{s}$ appears at least twice, and
• For every occurrence of the letter $\mathtt{u}$, the two nearest occurrences of $\mathtt{s}$ are the same number of characters away from the $\mathtt{u}$.

After watching you finish a string task, your friend Aka has gifted you a string $r$ consisting only of letters $\mathtt{s}$ and $\mathtt{u}$. You can perform the following operation on $r$:

• Choose an index $i$ ($1\le i\le |r|$), and set $r_i$ to $\mathtt{s}$.

Determine the minimum number of operations needed to make $r$ suspicious. It can be shown that, under the given constraints, it is always possible to transform $r$ into a suspicious string.

一个仅由小写拉丁字母组成的字符串 $w$ 被称为可疑的，当且仅当满足以下所有条件：

• 字母 $\mathtt{s}$ 至少出现两次；且
• 对于每一个字母 $\mathtt{u}$ 的出现位置，其左右两侧最近的两个 $\mathtt{s}$ 出现位置到该 $\mathtt{u}$ 的距离相等。

在目睹你完成一道字符串题目后，你的朋友 Aka 送给你一个仅由字母 $\mathtt{s}$ 和 $\mathtt{u}$ 组成的字符串 $r$。你可以对 $r$ 执行如下操作：

• 选择一个下标 $i$（$1\le i\le |r|$），并将 $r_i$ 修改为 $\mathtt{s}$。

请确定使 $r$ 变为可疑字符串所需的最少操作次数。可以证明：在给定约束条件下，总能将 $r$ 变为一个可疑字符串。

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 10^4$). The description of the test cases follows.

The only line of each test case contains the string $r$ ($3\le |r|\le 2\cdot 10^5$). It is guaranteed that $r_i = \mathtt{s}$ or $\mathtt{u}$.

It is guaranteed that the sum of $|r|$ over all test cases does not exceed $2\cdot 10 ^ 5$.

每个测试包含多个测试用例。第一行包含测试用例的数量 $t$（$1 \le t \le 10^4$）。随后是各测试用例的描述。

每个测试用例仅一行，包含字符串 $r$（$3\le |r|\le 2\cdot 10^5$）。保证 $r_i$ 为字符 $\mathtt{s}$ 或 $\mathtt{u}$。

保证所有测试用例的 $|r|$ 之和不超过 $2\cdot 10 ^ 5$。

For each test case, output a single integer — the minimum number of operations needed to make $r$ suspicious.

对于每个测试用例，输出一个整数——使 $r$ 变为可疑所需的最少操作次数。

In the first test case, the string $\mathtt{sus}$ is already suspicious because $\mathtt{s}$ appears twice in the string and the two nearest $\mathtt{s}$ to the only $\mathtt{u}$ are both $1$ character away: $\color{red}{\mathtt{s}}\underline{\mathtt{u}}\color{red}{\mathtt{s}}$.

In the second test case, it is optimal to perform the operation on indices $1$, $3$, and $4$. After that, the string $s$ becomes $\texttt{suss}$. The string $\mathtt{suss}$ is suspicious because $\mathtt{s}$ appears $3$ times in the string and the two nearest $\mathtt{s}$ to the only $\mathtt{u}$ are both $1$ character away: $\color{red}{\mathtt{s}}\underline{\mathtt{u}}\color{red}{\mathtt{s}}\mathtt{s}$.

In the third test case, the condition on $\mathtt{u}$ is vacuously true because there is no $\mathtt{u}$ in the string $\mathtt{sssss}$. Thus, the given string is already suspicious.

In the sixth test case, the initial string $\mathtt{usssssss}$ is not suspicious because the two nearest $\mathtt{s}$ to the only $\mathtt{u}$ are one and two characters away, respectively: $\underline{\mathtt{u}}\color{red}{\mathtt{ss}}\mathtt{sssss}$.

在第一个测试用例中，字符串 $\mathtt{sus}$ 已经是可疑的，因为 $\mathtt{s}$ 在该字符串中出现了两次，且唯一一个 $\mathtt{u}$ 的两个最近的 $\mathtt{s}$ 均相距 $1$ 个字符：$\color{red}{\mathtt{s}}\underline{\mathtt{u}}\color{red}{\mathtt{s}}$。

在第二个测试用例中，最优操作是将下标 $1$、$3$ 和 $4$ 处的字符执行操作。操作后，字符串 $s$ 变为 $\texttt{suss}$。字符串 $\mathtt{suss}$ 是可疑的，因为 $\mathtt{s}$ 在该字符串中出现了 $3$ 次，且唯一一个 $\mathtt{u}$ 的两个最近的 $\mathtt{s}$ 均相距 $1$ 个字符：$\color{red}{\mathtt{s}}\underline{\mathtt{u}}\color{red}{\mathtt{s}}\mathtt{s}$。

在第三个测试用例中，关于 $\mathtt{u}$ 的条件自动成立（vacuously true），因为字符串 $\mathtt{sssss}$ 中不含任何 $\mathtt{u}$。因此，给定字符串已经是可疑的。

在第六个测试用例中，初始字符串 $\mathtt{usssssss}$ 并不满足可疑条件，因为唯一一个 $\mathtt{u}$ 的两个最近的 $\mathtt{s}$ 分别相距 $1$ 个和 $2$ 个字符：$\underline{\mathtt{u}}\color{red}{\mathtt{ss}}\mathtt{sssss}$。