A15707 | Prepend and Append
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Timur initially had a binary string $^{\dagger}$ $s$ (possibly of length $0$ ). He performed the following operation several (possibly zero) times:
- Add $\texttt{0}$ to one end of the string and $\texttt{1}$ to the other end of the string. For example, starting from the string $\texttt{1011}$ , you can obtain either $\color{red}{\texttt{0}}\texttt{1011}\color{red}{\texttt{1}}$ or $\color{red}{\texttt{1}}\texttt{1011}\color{red}{\texttt{0}}$ .
You are given Timur's final string. What is the length of the shortest possible string he could have started with? $^{\dagger}$ A binary string is a string (possibly the empty string) whose characters are either $\texttt{0}$ or $\texttt{1}$ .
- Add $\texttt{0}$ to one end of the string and $\texttt{1}$ to the other end of the string. For example, starting from the string $\texttt{1011}$ , you can obtain either $\color{red}{\texttt{0}}\texttt{1011}\color{red}{\texttt{1}}$ or $\color{red}{\texttt{1}}\texttt{1011}\color{red}{\texttt{0}}$ .
You are given Timur's final string. What is the length of the shortest possible string he could have started with? $^{\dagger}$ A binary string is a string (possibly the empty string) whose characters are either $\texttt{0}$ or $\texttt{1}$ .
输入格式
The first line of the input contains an integer $t$ ( $1 \leq t \leq 100$ ) — the number of testcases.
The first line of each test case contains an integer $n$ ( $1 \leq n \leq 2000$ ) — the length of Timur's final string.
The second line of each test case contains a string $s$ of length $n$ consisting of characters $\texttt{0}$ or $\texttt{1}$ , denoting the final string.
The first line of each test case contains an integer $n$ ( $1 \leq n \leq 2000$ ) — the length of Timur's final string.
The second line of each test case contains a string $s$ of length $n$ consisting of characters $\texttt{0}$ or $\texttt{1}$ , denoting the final string.
输出格式
For each test case, output a single nonnegative integer — the shortest possible length of Timur's original string. Note that Timur's original string could have been empty, in which case you should output $0$ .
输入输出样例
输入 #1
9 3 100 4 0111 5 10101 6 101010 7 1010110 1 1 2 10 2 11 10 1011011010
输出 #1
1 2 5 0 3 1 0 2 4
In the first test case, the shortest possible string Timur started with is $\texttt{0}$ , and he performed the following operation: $\texttt{0} \to \color{red}{\texttt{1}}\texttt{0}\color{red}{\texttt{0}}$ .
In the second test case, the shortest possible string Timur started with is $\texttt{11}$ , and he performed the following operation: $\texttt{11} \to \color{red}{\texttt{0}}\texttt{11}\color{red}{\texttt{1}}$ .
In the third test case, the shortest possible string Timur started with is $\texttt{10101}$ , and he didn't perform any operations.
In the fourth test case, the shortest possible string Timur started with is the empty string (which we denote by $\varepsilon$ ), and he performed the following operations: $\varepsilon \to \color{red}{\texttt{1}}\texttt{}\color{red}{\texttt{0}} \to \color{red}{\texttt{0}}\texttt{10}\color{red}{\texttt{1}} \to \color{red}{\texttt{1}}\texttt{0101}\color{red}{\texttt{0}}$ .
In the fifth test case, the shortest possible string Timur started with is $\texttt{101}$ , and he performed the following operations: $\texttt{101} \to \color{red}{\texttt{0}}\texttt{101}\color{red}{\texttt{1}} \to \color{red}{\texttt{1}}\texttt{01011}\color{red}{\texttt{0}}$ .
In the second test case, the shortest possible string Timur started with is $\texttt{11}$ , and he performed the following operation: $\texttt{11} \to \color{red}{\texttt{0}}\texttt{11}\color{red}{\texttt{1}}$ .
In the third test case, the shortest possible string Timur started with is $\texttt{10101}$ , and he didn't perform any operations.
In the fourth test case, the shortest possible string Timur started with is the empty string (which we denote by $\varepsilon$ ), and he performed the following operations: $\varepsilon \to \color{red}{\texttt{1}}\texttt{}\color{red}{\texttt{0}} \to \color{red}{\texttt{0}}\texttt{10}\color{red}{\texttt{1}} \to \color{red}{\texttt{1}}\texttt{0101}\color{red}{\texttt{0}}$ .
In the fifth test case, the shortest possible string Timur started with is $\texttt{101}$ , and he performed the following operations: $\texttt{101} \to \color{red}{\texttt{0}}\texttt{101}\color{red}{\texttt{1}} \to \color{red}{\texttt{1}}\texttt{01011}\color{red}{\texttt{0}}$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted