CF391B.Word Folding

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

The input will consist of one line containing a single string of $n$ characters with $1<=n<=1000$ and no spaces. All characters of the string will be uppercase letters.

This problem doesn't have subproblems. You will get 5 points for the correct submission.

输入格式

Print a single integer — the size of the largest pile composed of identical characters that can be seen in a valid result of folding operations on the given string.

输出格式

Consider the first example. Manao can create a pile of three 'A's using the folding "AB|RACAD|ABRA", which results in the following structure:

 ABRA DACAR AB In the second example, Manao can create a pile of three 'B's using the following folding: "AB|BB|CBDB".

 CBDB BB AB Another way for Manao to create a pile of three 'B's with "ABBBCBDB" is the following folding: "AB|B|BCBDB".

 BCBDB B AB In the third example, there are no folds performed and the string is just written in one line.

输入输出样例

输入#1
```
ABRACADABRA
```
输出#1
```
3
```
输入#2
```
ABBBCBDB
```
输出#2
```
3
```
输入#3
```
AB
```
输出#3
```
1
```

说明/提示

Consider the first example. Manao can create a pile of three 'A's using the folding "AB|RACAD|ABRA", which results in the following structure:

 ABRA DACAR AB In the second example, Manao can create a pile of three 'B's using the following folding: "AB|BB|CBDB".

 CBDB BB AB Another way for Manao to create a pile of three 'B's with "ABBBCBDB" is the following folding: "AB|B|BCBDB".

 BCBDB B AB In the third example, there are no folds performed and the string is just written in one line.

首页