题目描述
You're given a string of lower-case Latin letters. Your task is to find the length of its longest substring that can be met in the string at least twice. These occurrences can overlap (see sample test 2).

输入描述
The first input line contains the string. It's guaranteed, that the string is non-empty, consists of lower-case Latin letters, and its length doesn't exceed 100.

输出描述
Output one number — length of the longest substring that can be met in the string at least twice.

样例输入
abcd
ababa
zzz
样例输出
0
3
2

无语。。。。

j+i-1这不会越界么？当n=6,i取5时，j+i-1=4+5-1=8,不是越界了么？

[ 本帖最后由 草狼 于 2010-8-9 13:35 编辑 ]

j+i-1这不会越界么？当n=6,i取5时，j+i-1=4+5-1=8,不是越界了么？

http://info.zjfc.
我已经AC了  不错代码太乱，所以想求个精简的

我想这题的关键就在 你如何穷举更有效率，不然就会超时，我的穷举太搓了，代码都不敢拿出来