hdu 2594 Simpsons’ Hidden Talents（KMP）

#include <stdio.h>
#include <string.h>
char s[100020],t[50010];
int next[100020];
int main()
{
int i,j,len,jlens,jlent;
while(scanf("%s %s",s,t) != EOF)
{
jlens = strlen(s);
jlent = strlen(t);
strcat(s,t);//连接字符串
len = strlen(s);
i = 0;
j = -1;
next[0] = -1;
while(i < len)
{
if(j == -1 || s[i] == s[j])
{
++i;
++j;
next[i] = j;
}
else
j = next[j];
}
while(next[len] > jlens || next[len] > jlent)//判断字符串长度是否合适
len = next[len];
len = next[len];
for(i = 0; i < len; ++i)
printf("%c",s[i]);
if(len) printf(" ");
printf("%d\n",len);
}
return 0;
}