A15939 | Tear It Apart
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given a string $s$ , consisting of lowercase Latin letters.
In one operation, you can select several (one or more) positions in it such that no two selected positions are adjacent to each other. Then you remove the letters on the selected positions from the string. The resulting parts are concatenated without changing their order.
What is the smallest number of operations required to make all the letters in $s$ the same?
In one operation, you can select several (one or more) positions in it such that no two selected positions are adjacent to each other. Then you remove the letters on the selected positions from the string. The resulting parts are concatenated without changing their order.
What is the smallest number of operations required to make all the letters in $s$ the same?
输入格式
The first line contains a single integer $t$ ( $1 \le t \le 10^4$ ) — the number of testcases.
The only line of each testcase contains a string $s$ , consisting of lowercase Latin letters. Its length is from $1$ to $2 \cdot 10^5$ .
The total length of the strings over all testcases doesn't exceed $2 \cdot 10^5$ .
The only line of each testcase contains a string $s$ , consisting of lowercase Latin letters. Its length is from $1$ to $2 \cdot 10^5$ .
The total length of the strings over all testcases doesn't exceed $2 \cdot 10^5$ .
输出格式
For each testcase, print a single integer — the smallest number of operations required to make all the letters in the given string $s$ the same.
输入输出样例
输入 #1
5 abacaba codeforces oooooooo abcdef mewheniseearulhiiarul
输出 #1
1 3 0 2 4
In the first testcase, you can select positions $2, 4$ and $6$ and remove the corresponding letters 'b', 'c' and 'b'.
In the third testcase, the letters in the string are already the same, so you don't have to make any operations.
In the fourth testcase, one of the possible solutions in $2$ operations is the following. You can select positions $1, 4, 6$ first. The string becomes "bce". Then select positions $1$ and $3$ . The string becomes "c". All letters in it are the same, since it's just one letter.
In the third testcase, the letters in the string are already the same, so you don't have to make any operations.
In the fourth testcase, one of the possible solutions in $2$ operations is the following. You can select positions $1, 4, 6$ first. The string becomes "bce". Then select positions $1$ and $3$ . The string becomes "c". All letters in it are the same, since it's just one letter.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted