Score : $200$ points

问题描述

你将得到一个字符串 $S$。请找出 $S$ 中最长的连续回文子串的长度。

注意：$S$ 总存在至少一个连续的回文子串。

以上为通义千问 qwen-max 翻译，仅供参考。

Problem Statement

You are given a string $S$. Find the maximum length of a contiguous substring of $S$ that is a palindrome.
Note that there is always a contiguous substring of $S$ that is a palindrome.

Constraints

• $S$ is a string of length between $2$ and $100$, inclusive, consisting of uppercase English letters.

Input

The input is given from Standard Input in the following format:

$S$

Output

Print the answer.

Sample Input 1

TOYOTA

Sample Output 1

5

TOYOT, a contiguous substring of TOYOTA, is a palindrome of length $5$.
TOYOTA, the only length-$6$ contiguous substring of TOYOTA, is not a palindrome, so print $5$.

Sample Input 2

ABCDEFG

Sample Output 2

1

Every contiguous substring of length $1$ is a palindrome.

Sample Input 3

AAAAAAAAAA

Sample Output 3

10

update @ 2024/3/10 01:38:13