题解 | Crazy Binary String-2019牛客暑期多校训练营第三场B题

最新推荐文章于 2020-08-12 17:54:46 发布

原创

最新推荐文章于 2020-08-12 17:54:46 发布 · 274 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#题解 #19牛客暑期多校训练营

题目来源于牛客竞赛：https://ac.nowcoder.com/acm/contest/discuss
题目描述：
ZYB loves binary strings (strings that only contains ‘0’ ‘1’ ). And he loves equal binary strings more, where the number of ‘0’ and the number `1’ in the string are equal.

ZYB wants to choose a substring from an original string T so that it is an equal binary string with the longest length possible. He also wants to choose a subsequence of T which meets the same requirements.

A string v is a substring of a string w if v is empty, or there are two integers l and r(1≤l≤r≤|w|) such that v=w₁w_l+1…w_r.A string v is a subsequence of a string \ w w if it can be derived from w by deleting any number (including zero) of characters without changing the order of the remaining characters.

For simplicity, you only need to output the maximum possible length. Note that the empty string is both a substring and a subsequence of any string.