回文自动机 - 問題

#801. 回文自动机

統計

题目描述

对于 $S$，记 $c_S(T)$ 表示 $T$ 在 $S$ 中的出现次数。对所有回文串 $T$，求 $\max_T(c_S(T) \cdot |T|^2)$。

输入格式

输入只有一行，包含一个字符串 $S$。

输出格式

输出一行一个整数，表示答案。

样例数据

样例 1 输入

hyddakioizjoi

样例 1 输出

样例 1 解释

取 $T=\mathsf{ioi}$。

样例 2 输入

hyakioivilavpnshadowsocksapioioihyakioiagain

样例 2 输出

样例 2 解释

取 $T=\mathsf{ioi}$。

子任务

对于所有数据，$|S| \leq 10^6$。

Subtask 1(35 Points): $|S| \leq 3.5 \times 10^4$。
Subtask 2(65 Points): 没有额外的限制。

Discussions

About Discussions

The discussion section is only for posting: Editorials, 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. Submitting multiple issues may cause your account to be banned.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0