@[lsy263](/space/show?uid=72611)
by Error_666 @ 2019-01-24 21:12:25
@[BigYellowDog](/space/show?uid=91681)
by lsy263 @ 2019-01-24 21:16:33
@[scPointer](/space/show?uid=12461)
by lsy263 @ 2019-01-24 21:17:11
@[BigYellowDog](/space/show?uid=91681) 为什么要hash...这个不是穷举吗
by lsy263 @ 2019-01-24 21:52:16
5分钟AC啊
```
#include<iostream>
#include<string>
using namespace std;
string a,b;
int main()
{
//freopen("data.in","r",stdin);
ios::sync_with_stdio(false);
cin>>a>>b;
int la=a.size(),lb=b.size();
int MAXN=0;
for(int i=0;i<la;++i)
{
int j=lb-i-1;bool f=true;
for(int k1=0,k2=j;k1<=i&&k2<lb;++k1,++k2)
if(a[k1]!=b[k2]){f=false;break;}
if(f)MAXN=MAXN<i+1?i+1:MAXN;
}
for(int i=0;i<lb;++i)
{
int j=la-i-1;bool f=true;
for(int k1=0,k2=j;k1<=i&&k2<lb;++k1,++k2)
if(b[k1]!=a[k2]){f=false;break;}
if(f)MAXN=MAXN<i+1?i+1:MAXN;
}
cout<<MAXN;
return 0;
}
```
by lsy263 @ 2019-01-24 21:52:46
O($len^{2}$)
by lsy263 @ 2019-01-24 21:53:26
@[lsy263](/space/show?uid=72611) 为了练习Hash
by Error_666 @ 2019-01-24 21:54:04
@[BigYellowDog](/space/show?uid=91681) 那你慢慢哈吧...qwq这种题也哈希...
by lsy263 @ 2019-01-24 21:56:28
哈希……听起来好高级
by wanghuiheng @ 2019-12-21 13:07:49
~~结果你mod开107报了~~
你能不能把mod写大亿点?
还有,自然溢出不行吗?!!
~~插句题外话~~:@ lsy263:我4min AC
by cleverxia @ 2022-02-12 22:37:14