hdu 2594 Simpsons’ Hidden Talent (kmp)
题意：given string s1,s2, find the longest prefix of s1 that is a suffix of s2.
思路：kmp。。。懒得说了。注意边界。
/* ***********************************************
Author :111qqz
Created Time :2016年08月12日 星期五 01时12分51秒
File Name :code/hdu/2594.cpp
************************************************ */
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <ctime>
#define fst first
#define sec second
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define ms(a,x) memset(a,x,sizeof(a))
typedef long long LL;
#define pi pair < int ,int >
#define MP make_pair
using namespace std;
const double eps = 1E-8;
const int dx4[4]={1,0,0,-1};
const int dy4[4]={0,-1,1,0};
const int inf = 0x3f3f3f3f;
const int N=5E5+7;
char a[N],b[N];
int nxt[N];
void getnxt( char *s)
{
int n = strlen(s);
int i = 0 ;
int j = -1;
nxt[0] = -1;
while (i<n)
if (j==-1||s[i]==s[j]) nxt[++i]=++j;
else j = nxt[j];
}
int kmp(char *a,char *b)
{
int n = strlen(a);
int m = strlen(b);
getnxt(b);
int i = 0;
int j = 0;
while (i<n)
{
if (j==-1||a[i]==b[j]) i++,j++;
else j = nxt[j];
}
if (i==n) return j;
return 0;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("code/in.txt","r",stdin);
#endif
while (~scanf("%s %s",a,b))
{
// cout<<"a:"<<a<<" b:"<<b<<endl;
int k = kmp(b,a);
if (k==0)
puts("0");
else printf("%s %d\n",b+(strlen(b)-k),k);
ms(a,0);
ms(b,0);
}
#ifndef ONLINE_JUDGE
fclose(stdin);
#endif
return 0;
}