QOJ.ac

QOJ

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

#217. 后缀自动机

统计

题目描述

给定一个只包含小写字母的字符串 $S$,

请你求出 $S$ 的所有出现次数不为 1 的子串的出现次数乘上该子串长度的最大值。

输入格式

一行一个字符串 $S$。

输出格式

一行一个整数表示答案。

样例数据

样例输入

ababcbasdcbbadbcbad

样例输出

8

子任务

对于所有数据,$|S| \leq 2 \times 10^5$。

About Issues

We understand that our problem archive is not perfect. If you find any issues with the problem, including the statement, scoring configuration, time/memory limits, test cases, etc.

You may use this form to submit an issue regarding the problem. A problem moderator will review your issue and proceed it properly.

STOP! Before you submit an issue, please READ the following guidelines:

  1. This is not a place to publish a discussion, editorial, or requests to debug your code. Your issue will only be visible by you and problem moderators. Other users will not be able to view or reply your issues.
  2. Do not submit duplicated issues. If you have already submitted one, please wait for an moderator to review it. Submitting multiple issues will not speed up the review process and might cause your account to be banned.
  3. Issues must be filed in English or Chinese only.
  4. Be sure your issue is related to this problem. If you need to submit an issue regarding another problem, contest, category, etc., you should submit it to the corresponding page.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0

No issues in this category.