Balanced Substring CodeForces - 873B (思维+前缀和)

Balanced Substring

CodeForces - 873B

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

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

Input

3
111

Output

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.

题目大意：字符串是由0和1组成，求字符串的最长子串，使0和1的数目相同

思路：维护一个前缀和，初始化sum为n，如果是0，--，如果是1就++，如果这个sum值之前出现过了，那么说明最早出现这个值的位置和现在位置的长度就是当前构成01相等字符串的长度，每次更新ans。

code：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int INF = 0x3f3f3f3f;
int Min[200005];//Min[sum]表示前缀和sum的最早出现位置
char s[100005];
int main(){int n,sum,len,ans;while(scanf("%d",&n) != EOF){scanf("%s",s+1);sum = n;//防止sum为负数导致Min数组越界初始化为nans = 0;len = strlen(s+1);memset(Min,INF,sizeof(Min));Min[sum] = 0;//初始Min[n]=0,如果整个串01个数相同就是原长度for(int i = 1; i <= len; i++){if(s[i] == '0') sum--;else sum++;Min[sum] = min(Min[sum],i);ans = max(ans,i - Min[sum]);}printf("%d\n",ans);}return 0;
}

Balanced Substring CodeForces - 873B (思维+前缀和)相关推荐

codeforces Balanced Substring
B. Balanced Substring time limit per test 1 second memory limit per test 256 megabytes input standar ...
A. Balanced Substring
题目如下: You are given a string s, consisting of n letters, each letter is either 'a' or 'b'. The lette ...
Balanced Substring
You are given a string s consisting only of characters 0 and 1. A substring [l, r] of s is a string ...
Codeforces Round #632 (Div. 2) C. Eugene and an array 思维 + 前缀和
传送门文章目录题意: 思路: 题意: 给定一个长度为nnn的序列aaa,定义一段区间为好区间是这段区间的所有连续子区间的和都不为000,求好区间的个数. 思路: 套路题,定义aia_iai的前缀 ...
CodeForces-1016C Vasya And The Mushrooms(模拟+思维+前缀和的前缀和) 解题报告 Apare_xzc
CodeForces-1016C Vasya And The Mushrooms(模拟+思维+二重前缀和 ) 解题报告 xzc 2019/4/7 这周周赛的C题:wyt学姐的恶意这道题周赛的时候 ...
575 div3RGB Substring (hard version)——思维-
[题目描述] The only difference between easy and hard versions is the size of the input. You are given a ...
CodeForces - 948C（前缀和 + 二分）
链接:CodeForces - 948C 题意:N天,每天生产一堆雪体积 V[i] ,每天每堆雪融化 T[i],问每天融化了多少雪. 题解:对 T 求前缀和,求每一堆雪能熬过多少天,再记录一下多余的就 ...
CodeForces 798D 思维,贪心
CodeForces 798D 题意:长度为 n的两个数组 a[]和 b[],要找出 k ( k<=n/2+1 )个下标,使得在两个数组中这 k个数的和乘上 2 要大于所有数的和. tags: ...
C. k-Amazing Numbers(思维前缀最小值+枚举相同数距离)
https://codeforces.com/contest/1417/problem/C 大晚上的想岔了.. a1,a2,-,an (1≤ai≤n)这个范围其实就在暗示要枚举出现的数.但是我不知道怎 ...

Balanced Substring CodeForces - 873B (思维+前缀和)

Balanced Substring

Balanced Substring CodeForces - 873B (思维+前缀和)相关推荐

最新文章

热门文章