题目链接:
http://acm.hdu.edu.cn/showproblem.php?pid=2594
题意:
所谓扩展kmp:
给出主串S和模式串T,长度分别为slen和tlen,要求在线性时间内,对于每个S[i](0<=i
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;
int nxt[100050];
int extend[100050];
char s[100050], t[100050];
void getnext(const char *t)
{
int a = 0;
int tlen = strlen(t);
nxt[0] = tlen;
while(a < tlen - 1 && t[a] == t[a+1])
a++;
nxt[1] = a;
a = 1;
for(int k = 2; k < tlen; k++)
{
int p = a+nxt[a]-1, l = nxt[k-a];
if((k-1) + l >= p)
{
int j = (p-k+1) > 0? p-k+1:0;
while(k+j<tlen && t[k+j] == t[j])
j++;
nxt[k] = j;
a = k;
}
else
nxt[k] = l;
}
}
void exkmp(char*s , char*t)
{
int a = 0;
getnext(t);
int slen = strlen(s);
int tlen = strlen(t);
int minLen = slen<tlen? slen:tlen;
while(a < minLen && s[a] == t[a])a++;
extend[0] = a;
a = 0;
for(int k = 1; k < slen; k++)
{
int p = a + extend[a] - 1, l = nxt[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++;
extend[k] = j;
a = k;
}
else
extend[k] = l;
}
}
int main()
{
while(cin >> s >> t)
{
exkmp(t,s);
int ans = 0;
int slen = strlen(s),tlen = strlen(t);
for(int i = tlen - 1, j = 0; j < slen; j++, i--)
{
if(extend[i] == tlen - i)
{
ans = max(ans, extend[i]);
}
}
if(ans)
{
for(int i = 0; i < ans; i++)
cout << s[i];
cout << " ";
}
cout << ans <<endl;
}
return 0;
}