← 返回题目

题库练习 K-Dominant Character

← 上一题下一题 →

A11424 | $K-Dominant Character$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

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

zzzzz

输出 #2

输入 #3

abcde

输出 #3

C++ 编辑器

输入

输出