codeforces Balanced Substring

B. Balanced Substring
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given a string s consisting only of characters 0 and 1. A substring [l, r] of s is a string slsl + 1sl + 2... sr, 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.

Input

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.

Output

If there is no non-empty balanced substring in s, print 0. Otherwise, print the length of the longest balanced substring.

Examples
input
8
11010111
output
4
input
3
111
output
0
Note

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.


题解:a[i]表示的是[0..i]区间内1和0的个数之差。

如果a[i]==a[j]的话,那么[i+1,j]区间1和0的数量相同。

确定下每个a[i]出现的最早下标和最晚下标,做差一下,然后更新答案即可。

代码:

#include <bits/stdc++.h>
using namespace std;
int n,x,k; 
const int maxn = 100010;
int a[maxn];
map<int,int> mark;
int main(){
	cin>>n;
	int nums = 0;
	for(int i = 1;i <= n;++i){
		char c;
		scanf(" %c",&c);
		if(c == '0') nums--;
		else nums++;
		a[i] = nums;
		if(!mark[nums]) mark[nums] = i;
	}
	mark[0] = 0;
	int ans = 0;
	for(int i = 1;i <= n;++i){
		ans = max(ans,i - mark[a[i]]);
	}
	cout<<ans<<endl;
}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值