# Atcoder 88 D-Wide Flip

/ 0评 / 0

Time limit : 2sec / Memory limit : 256MB
You are given a string $S$ consisting of and 1. Find the maximum integer $K$ not greater than $|S|$ such that we can turn all the characters of $S$ into by repeating the following operation some number of times.
Choose a contiguous segment $[l,r]$ in $S$ whose length is at least $K$ (that is,$r-l+1\geq K$ must be satisfied). For each integer $i$ such that $l\leq i\leq r$, do the following: if $S_i$ is , replace it with 1; if $S_i$ is 1, replace it with .

#### Constraints

$1\leq|S|\leq10^5$
$S_i(1\leq i\leq N)$ is either or 1.

#### 題解：

[l,r]中所有的 11，最後使得 01字符串全 ，求最大的$K$

• 默认
• 护眼
• 夜晚
• Serif
• Sans