QOJ.ac

QOJ

Time Limit: 1 s Memory Limit: 256 MB Total points: 100

#217. Suffix Automaton

The problem was used in the following contests:

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

Given a string $S$ consisting only of lowercase letters, find the maximum value of the product of the frequency and the length of any substring of $S$ that appears more than once.

Input

A single line containing the string $S$.

Output

A single integer representing the answer.

Constraints

For all test cases, $|S| \leq 2 \times 10^5$.

Examples

Input 1

ababcbasdcbbadbcbad

Output 1

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0

No issues in this category.