A11183 | Balanced Substring
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given a string $s$ consisting only of characters 0 and 1. A substring $[l,r]$ of $s$ is a string $s_{l}s_{l+1}s_{l+2}...\ s_{r}$ , and its length equals to $r-l+1$ . A substring is called balanced if the number of zeroes (0) equals to the number of ones in this substring.
You have to determine the length of the longest balanced substring of $s$ .
You have to determine the length of the longest balanced substring of $s$ .
输入格式
The first line contains $n$ ( $1<=n<=100000$ ) — the number of characters in $s$ .
The second line contains a string $s$ consisting of exactly $n$ characters. Only characters 0 and 1 can appear in $s$ .
The second line contains a string $s$ consisting of exactly $n$ characters. Only characters 0 and 1 can appear in $s$ .
输出格式
If there is no non-empty balanced substring in $s$ , print 0. Otherwise, print the length of the longest balanced substring.
输入输出样例
输入 #1
8 11010111
输出 #1
4
输入 #2
3 111
输出 #2
0
In the first example you can choose the substring $[3,6]$ . It is balanced, and its length is $4$ . Choosing the substring $[2,5]$ is also possible.
In the second example it's impossible to find a non-empty balanced substring.
In the second example it's impossible to find a non-empty balanced substring.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted