CodeForces 23A You're Given a String...（字符串处理）

Description
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).

Input
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
Output one number — length of the longest substring that can be met in the string at least twice.

Sample Input
Input
abcd
Output
0
Input
ababa
Output
3
Input
zzz
Output
2

题意：
计算一个字符串中可重复出现子串最大长度。

分析：
又是一个水题的题解。//你提莫只会做水题吗！！
但是，
水题不会比难题不会问题更严重，
难题不会，多半是姿势不会，
但水题不会，那就是姿势不对了。
所以这份题解还是很重要的！//理由充分，态度积极，一本正经，胡说八道。

以下为正经题解：
由题意可知，该字符串子串一定出现了两次，所以两层for循环遍历字符串可直接得出。//为什么当时就想不出来！！！

代码如下：

#include<iostream>
#include<sstream>
#include<fstream>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
#include<ctime>
#include<iomanip>
using namespace std;
const double eps(1e-8);
typedef long long lint;

int main(){
        string s;
        while(cin >> s){
                int ls = s.length() ;
                int max1 = 0;
                for(int i = 0 ; i < ls ; i++){
                        for( int j = i + 1 ; j < ls ; j++){
                                int m = 0;
                                while(s[i + m] == s[j + m] ){
                                        m++;
                                }
                                max1 = max(m,max1);

                        }
                }
                cout << max1 << endl;
        }
        return 0;
}