# Codeforces 873B Balanced Substring（利用前缀和找和为0的子串）

B. Balanced Substring
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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.

### 题目大意

给你一个长度最大为105$10^5$的01串，求最长的满足0和1个数相同的子串。

### 解题思路

一个比较常见的技巧了。
维护一个前缀和，如果当前字符为0则-1，如果当前字符为1则+1。然后记录每个前缀和的值的第一次出现的位置，在扫描的过程中如果这个和出现过就利用两个位置的差算出长度，更新答案。

### AC代码

#include<iostream>
#include<cstdio>
#include <cstring>
#include <string>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <stack>
#include <cmath>
#include <algorithm>
using namespace std;
#define INF 0x3f3f3f3f
#define LL long long
#define mem(a,b) memset((a),(b),sizeof(a))

const int MAXN=100000+3;
int N, first_p[MAXN*2];
char s[MAXN];

int main()
{
scanf("%d%s", &N, s);
mem(first_p, 0x3f);//用INF表示没有出现过
int sum=0, ans=0;
first_p[N]=-1;
for(int i=0;i<N;++i)
{
if(s[i]=='1')
++sum;
else --sum;
if(first_p[sum+N]==INF)
first_p[sum+N]=i;
else ans=max(ans, i-first_p[sum+N]);
}
printf("%d\n", ans);

return 0;
}