差分、前缀和学习记录

A - Balanced Substring
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.

Sponsor

题意：平衡字符串，0,1个数相等的字符串
问字符串中平衡字符串最长有多长

前缀和求解，将0——>-1,找相同的前缀和，下标相减

#include <iostream>
#include <cstdio>
#include <map>
#include <algorithm>
#define maxn 100005
using namespace std;

map <int,int> m;                ///我们用m来储存< 前缀和 , 第一次出现此数值的数组下标 >

int main()
{
    m[0]=1;                         ///避免出现10101010这种情况
    int n;
    char s[maxn];
    int a[maxn];
    scanf("%d%s",&n,s+1);
    for(int i=1;i<=n;i++){
        if(s[i]=='0')                  ///为什么要让0变为-1？
            a[i]=-1;      ///因为-1可以抵消一个1，这样我们就可以通过找相同的前缀和,来判断平衡字符串的长度
        else
            a[i]=1;
    }
    int sum=0,ans=0;
    for(int i=1;i<=n;i++){
        sum+=a[i];
        if(m[sum]){
            ans=max(ans,i-m[sum]+1);          ///i-m[sum]为平衡字符串的长度，m多-1，故+1
        }
        else
            m[sum]=i+1;         ///为什么+1，因为m[0]=1;当出现如：特例10101010时，为8-1，而非8-0，所以+1，就可以多-1
    }
    printf("%d\n",ans);
    return 0;
}