HDU-2549 Simpsons’ Hidden Talents

题目链接：https://vjudge.net/problem/HDU-2594

用扩展kmp算法做

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;
const int N = 50010;
int next0
,extand
;
void getnext(char *T){// next[i]: 以第i位置开始的子串 与 T的公共前缀
int i,length = strlen(T);
next0[0] = length;
for(i = 0;i<length-1 && T[i]==T[i+1]; i++);
next0[1] = i;
int a = 1;
for(int k = 2; k < length; k++){
int p = a+next0[a]-1, L = next0[k-a];
if( (k-1)+L >= p ){
int j = (p-k+1)>0? (p-k+1) : 0;
while(k+j<length && T[k+j]==T[j]) j++;// 枚举(p+1，length) 与(p-k+1,length) 区间比较
next0[k] = j, a = k;
}
else next0[k] = L;
}
}
void getextand(char *S,char *T){
memset(next0,0,sizeof(next0));
getnext(T);
int Slen = strlen(S), Tlen = strlen(T), a = 0;
int MinLen = Slen>Tlen?Tlen:Slen;
while(a<MinLen && S[a]==T[a]) a++;
extand[0] = a, a = 0;
for(int k = 1; k < Slen; k++){
int p = a+extand[a]-1, L = next0[k-a];
if( (k-1)+L >= p ){
int j = (p-k+1)>0? (p-k+1) : 0;
while(k+j<Slen && j<Tlen && S[k+j]==T[j] ) j++;
extand[k] = j;a = k;
}
else extand[k] = L;
}
}
char a
,b
;
int main()
{
while(~scanf("%s%s",a,b))
{
getextand(b,a);
int ans=0,l=strlen(b);
for(int i=0;i<l;i++)
if(extand[i]==l-i)
{
ans=l-i;
break;
}
if(ans) printf("%s ",b+l-ans);
printf("%d\n",ans);
}
return 0;
}