HDU - 2594 Simpsons’ Hidden Talents（KMP模板题）

HDU - 2594 Simpsons’ Hidden Talents

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N = 50010;
char aa[N],bb[N];
string b;
int ne[N*2],n,m;
void get_next()
{
    for(int i=2,j=0;i<=m;i++)
	{
		while(j&&b[i]!=b[j+1]) j=ne[j];
		if(b[i]==b[j+1]) j++;
		ne[i]=j;
	}
}
int main()
{
	while(scanf("%s%s",aa,bb)!=EOF)
	{
		b='\0';b=b+aa;b=b+'#';b=b+bb;
		m=b.size()-1;
	    get_next();
	    if(ne[m]==0) puts("0");
		else printf("%s %d\n",b.substr(1,ne[m]).c_str(),ne[m]);
	}
	return 0;
}