CF1860E.Fast Travel Text Editor

You are given a string $s$, consisting of lowercase Latin letters.

There's a cursor, initially placed between two adjacent letters of the string. The cursor can't be placed before the first or after the last letter.

In one move, you can perform one of three actions:

• move a cursor one position to the left (if that doesn't place it before the first letter);
• move a cursor one position to the right (if that doesn't place it after the last letter);
• let $x$ be the letter immediately to the left of the cursor, and $y$ be the letter immediately to the right of the cursor. Choose any pair of adjacent letters in the string such that the left of them is $x$ and the right of them is $y$, and move the cursor to the position between these two letters.

You are asked $m$ queries. In each query, you are given two integers $f$ and $t$, which correspond to two valid positions of the cursor in the string. In response to the query, you have to calculate the minimum number of operations required to move the cursor from position $f$ to position $t$.

给你一个由小写拉丁字母组成的字符串 $s$。

有一个光标，初始时位于字符串中两个相邻字母之间。光标不能置于第一个字母之前或最后一个字母之后。

每次操作可以执行以下三种动作之一：

• 将光标向左移动一个位置（前提是移动后不会置于第一个字母之前）；
• 将光标向右移动一个位置（前提是移动后不会置于最后一个字母之后）；
• 设光标左侧紧邻的字母为 $x$，右侧紧邻的字母为 $y$；在字符串中任选一对相邻字母，使得其左侧字母为 $x$、右侧字母为 $y$，然后将光标移至这对相邻字母之间。

你需要处理 $m$ 个查询。每个查询给出两个整数 $f$ 和 $t$，分别表示字符串中两个合法的光标位置。对于每个查询，你需要计算将光标从位置 $f$ 移动到位置 $t$ 所需的最少操作次数。

The first line contains a string $s$ ($2 \le |s| \le 5 \cdot 10^4$), consisting of lowercase Latin letters.

The second line contains a single integer $m$ ($1 \le m \le 5 \cdot 10^4$) — the number of queries.

The $i$-th of the next $m$ lines contains two integers $f$ and $t$ ($1 \le f, t \le |s| - 1$) — the initial and the target positions of the cursor in the $i$-th query. Position $x$ means that the cursor is between the $x$-th and the $(x+1)$-st letters of the string ($1$-indexed).

第一行包含一个字符串 $s$（$2 \le |s| \le 5 \cdot 10^4$），由小写拉丁字母组成。

第二行包含一个整数 $m$（$1 \le m \le 5 \cdot 10^4$）—— 查询次数。

接下来的 $m$ 行中，第 $i$ 行包含两个整数 $f$ 和 $t$（$1 \le f, t \le |s| - 1$）—— 第 $i$ 次查询中光标的初始位置和目标位置。位置 $x$ 表示光标位于字符串中第 $x$ 个与第 $(x+1)$ 个字母之间（位置下标从 $1$ 开始）。

For each query, print the minimum number of actions required to move the cursor from position $f$ to position $t$.

对于每个查询，输出将光标从位置 $f$ 移动到位置 $t$ 所需的最少操作次数。