题目描述
给定一个只包含小写字母的字符串 $S$,
请你求出 $S$ 的所有出现次数不为 1 的子串的出现次数乘上该子串长度的最大值。
输入格式
一行一个字符串 $S$。
输出格式
一行一个整数表示答案。
样例数据
样例输入
ababcbasdcbbadbcbad样例输出
8子任务
对于所有数据，$|S| \leq 2 \times 10^5$。
QOJ.ac
QOJ
As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
Time Limit:
1 s
Memory Limit:
256 MB
Total points:
100
#217. 后缀自动机
Statistics
The problem was used in the following contests:
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
No issues in this category.