Solve equation

最新推荐文章于 2020-07-21 15:59:55 发布

h1021456873

最新推荐文章于 2020-07-21 15:59:55 发布

阅读量418

点赞数

分类专栏： STL

本文链接：https://blog.csdn.net/h1021456873/article/details/50991761

版权

STL 专栏收录该内容

34 篇文章 0 订阅

订阅专栏

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

Input

ababa

Output

Input

zzz

Output

</pre><pre name="code" class="cpp">#include<iostream>
#include<cstring>
#include<algorithm>
#include<map>
#include<cstdio>
#include<string>
using namespace std;
map<string,int>num;
int main()
{
    string s,name;
    int i,j,k,n;
    cin>>s;
    n=s.size();
    for(k=1;k<=n;k++) {
        for(i=0;i+k<=n;i++) {
            name="";
            for(j=i;j<i+k;j++) {
                name=name+s[j];
            }
            num[name]++;
            if(num[name]>1) break;
        }
        if(i+k>n) break;
    }
    cout<<k-1<<endl;
    return 0;
}