NSUBSTR - Substrings

你得到了一个最多由 $250000$ 个小写拉丁字母组成的字符串 $S$。定义 $F(x)$ 为 $S$ 的某些长度为 $x$ 的子串在 $S$ 中的最大出现次数。即 $F(x)=max\{times(T)\}$，满足 $T$ 是 $S$ 的子串且 $|T|=x$。例如当 $S=ababa$ 时 $F(3)=2$ ，因为 $S$ 中有一个出现 $2$ 次的子串 $aba$。 你的任务是对于每个 $1\le i \le |S|$ 输出 $F(i)$。

You are given a string S which consists of 250000 lowercase latin letters at most. We define F(x) as the maximal number of times that some string with length x appears in S. For example for string 'ababa' F(3) will be 2 because there is a string 'aba' that occurs twice. Your task is to output F(i) for every i so that 1<=i<=|S|.

String S consists of at most 250000 lowercase latin letters.

Output |S| lines. On the i-th line output F(i).

ababa

3
2
2
1
1