A16327 | AB Flipping
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given a string $s$ of length $n$ consisting of characters $\texttt{A}$ and $\texttt{B}$ . You are allowed to do the following operation:
- Choose an index $1 \le i \le n - 1$ such that $s_i = \texttt{A}$ and $s_{i + 1} = \texttt{B}$ . Then, swap $s_i$ and $s_{i+1}$ .
You are only allowed to do the operation at most once for each index $1 \le i \le n - 1$ . However, you can do it in any order you want. Find the maximum number of operations that you can carry out.
- Choose an index $1 \le i \le n - 1$ such that $s_i = \texttt{A}$ and $s_{i + 1} = \texttt{B}$ . Then, swap $s_i$ and $s_{i+1}$ .
You are only allowed to do the operation at most once for each index $1 \le i \le n - 1$ . However, you can do it in any order you want. Find the maximum number of operations that you can carry out.
输入格式
Each test contains multiple test cases. The first line contains the number of test cases $t$ ( $1 \le t \le 1000$ ). Description of the test cases follows.
The first line of each test case contains a single integer $n$ ( $2 \le n \le 2\cdot 10^5$ ) — the length of string $s$ .
The second line of each test case contains the string $s$ ( $s_i=\texttt{A}$ or $s_i=\texttt{B}$ ).
It is guaranteed that the sum of $n$ over all test cases does not exceed $2\cdot 10^5$ .
The first line of each test case contains a single integer $n$ ( $2 \le n \le 2\cdot 10^5$ ) — the length of string $s$ .
The second line of each test case contains the string $s$ ( $s_i=\texttt{A}$ or $s_i=\texttt{B}$ ).
It is guaranteed that the sum of $n$ over all test cases does not exceed $2\cdot 10^5$ .
输出格式
For each test case, print a single integer containing the maximum number of operations that you can carry out.
输入输出样例
输入 #1
3 2 AB 4 BBBA 4 AABB
输出 #1
1 0 3
In the first test case, we can do the operation exactly once for $i=1$ as $s_1=\texttt{A}$ and $s_2=\texttt{B}$ .
In the second test case, it can be proven that it is not possible to do an operation.
In the third test case, we can do an operation on $i=2$ to form $\texttt{ABAB}$ , then another operation on $i=3$ to form $\texttt{ABBA}$ , and finally another operation on $i=1$ to form $\texttt{BABA}$ . Note that even though at the end, $s_2 = \texttt{A}$ and $s_3 = \texttt{B}$ , we cannot do an operation on $i=2$ again as we can only do the operation at most once for each index.
In the second test case, it can be proven that it is not possible to do an operation.
In the third test case, we can do an operation on $i=2$ to form $\texttt{ABAB}$ , then another operation on $i=3$ to form $\texttt{ABBA}$ , and finally another operation on $i=1$ to form $\texttt{BABA}$ . Note that even though at the end, $s_2 = \texttt{A}$ and $s_3 = \texttt{B}$ , we cannot do an operation on $i=2$ again as we can only do the operation at most once for each index.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted