CF888C.K-Dominant Character

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

You are given a string $s$ consisting of lowercase Latin letters. Character $c$ is called $k$ -dominant iff each substring of $s$ with length at least $k$ contains this character $c$ .

You have to find minimum $k$ such that there exists at least one $k$ -dominant character.

输入格式

The first line contains string $s$ consisting of lowercase Latin letters ( $1<=|s|<=100000$ ).

输出格式

Print one number — the minimum value of $k$ such that there exists at least one $k$ -dominant character.

输入输出样例

输入#1
```
abacaba
```
输出#1
```
2
```
输入#2
```
zzzzz
```
输出#2
```
1
```
输入#3
```
abcde
```
输出#3
```
3
```

首页