ＡＴＯＤ

Long Long MessageTime Limit: 4000MS Memory Limit: 131072K Total Submissions: 25348 Accepted: 10371 Case Time Limit: 1000MS DescriptionThe little cat is majoring in physics in the capital of Byter

后缀数组Musical ThemeTime Limit: 1000MS Memory Limit: 30000K Total Submissions: 24173 Accepted: 8156 DescriptionA musical melody is represented as a sequence of N (1<=N<=20000)notes that are integers in th

Milk Patterns Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 12990 Accepted: 5775 Case Time Limit: 2000MSDescriptionFarmer John has noticed that the quality of milk given by

、Life FormsTime Limit: 5000MS Memory Limit: 65536K Total Submissions: 12433 Accepted: 3482 DescriptionYou may have wondered why most extraterrestrial life forms resemble humans, differing by superf

Good Article Good sentence Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3171 Accepted Submission(s): 914Problem Description In middle s

给你一个由小写拉丁字母组成的字符串 ss。我们定义 ss 的一个子串的存在值为这个子串在 ss 中出现的次数乘以这个子串的长度。对于给你的这个字符串 ss，求所有回文子串中的最大存在值。 输入格式一行，一个由小写拉丁字母（a~z）组成的非空字符串 ss。 输出格式输出一个整数，表示所有回文子串中的最大存在值。

#include<iostream>#include<stdio.h>#include<string.h>using namespace std;const int maxn=200005;char text[maxn];int SA[maxn];int wa[maxn],wb[maxn],wv[maxn],cnt[maxn];int height[maxn],h[maxn];in