题目链接:点击进入
题目
题意
对字符串 s ,找最长的 t ,满足 t 在 s 的前后缀以及中间部分出现过
思路
通过 next 数组由长到短枚举 s 所有相同的前后缀,然后在中间部分通过 next 数组找是否出现过这个子串
代码
// Problem: Password
// Contest: Virtual Judge - CodeForces
// URL: https://vjudge.net/problem/CodeForces-126B
// Memory Limit: 262 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
//#pragma GCC optimize(3)//O3
//#pragma GCC optimize(2)//O2
#include<iostream>
#include<string>
#include<map>
#include<set>
//#include<unordered_map>
#include<queue>
#include<cstdio>
#include<vector>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<fstream>
#define X first
#define Y second
#define base 233
#define INF 0x3f3f3f3f3f3f3f3f
#define pii pair<int,int>
#define lowbit(x) x & -x
#define inf 0x3f3f3f3f
//#define int long long
//#define double long double
//#define rep(i,x,y) for(register int i = x; i <= y;++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double pai=acos(-1.0);
const int maxn=1e6+10;
const int mod=1e9+7;
const double eps=1e-9;
const int N=5e3+10;
/*--------------------------------------------*/
inline int read()
{
int k = 0, f = 1 ;
char c = getchar() ;
while(!isdigit(c)){if(c == '-') f = -1 ;c = getchar() ;}
while(isdigit(c)) k = (k << 1) + (k << 3) + c - 48 ,c = getchar() ;
return k * f ;
}
/*--------------------------------------------*/
int Next[maxn];
string s;
void getnext(string s,int len)
{
int k=-1,j=0;
Next[0]=-1;
while(j<len)
{
if(k==-1||s[j]==s[k])
{
k++;
j++;
Next[j]=k;
}
else k=Next[k];
}
}
int main()
{
// ios::sync_with_stdio(false);
// cin.tie(0);cout.tie(0);
cin>>s;
int len=s.size();
getnext(s,len);
int l=Next[len],flag=0,ans=0;
if(l==0) flag=0;
else
{
while(l)
{
for(int i=2;i<=len-1;i++)
{
if(Next[i]==l)
{
flag=1;
break;
}
}
if(flag) break;
l=Next[l];
}
}
if(!flag) cout<<"Just a legend"<<endl;
else
{
for(int i=0;i<l;i++)
cout<<s[i];
}
return 0;
}