如果看了我博客介绍还没懂KMP,则下面链接拿好。
扩展KMP
HDU 2087 剪花布条 求匹配次数(不可重叠)
#include <cmath>
#include <cstring>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 1000 + 5;
int nxt[maxn];
void getNext(string s) {
int i = 0, j = -1;
int len = s.length();
nxt[0] = -1;
while (i < len) {
if (j == -1 || s[i] == s[j]) {i++, j++; nxt[i] = j;}
else j = nxt[j];
}
}
int kmp(string s1, string s2) {
int cnt = 0;
getNext(s2);
int i = 0, j = 0;
int len1 = s1.length(), len2 = s2.length();
while (i < len1 && j <= len2) {
if (j == -1 || s1[i] == s2[j]) i++, j++;
else j = nxt[j];
if (j == len2) { cnt++; j = 0; }
}
return cnt;
}
int main() {
// freopen("1.in","r",stdin);
string s, p;
while (cin >> s,s[0]!='#') {
cin >> p;
cout << kmp(s, p) << endl;
}
return 0;
}
求匹配的次数(可重叠),跟上面的区别就是匹配成功后跳到 next[j] 而非0
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define RE freopen("in.txt","r",stdin);
const int maxn = 1e5 + 5;
const int inf = 0x3f3f3f3f;
int nxt[maxn];
void getNext(string s) {
int i = 0, j = -1;
int len = s.length();
nxt[0] = -1;
while (i < len) {
if (j == -1 || s[i] == s[j]) nxt[++i] = ++j;
else j = nxt[j];
}
}
int kmp(string s1, string s2) {
int cnt = 0;
getNext(s2);
int i = 0, j = 0;
int len1 = s1.length(), len2 = s2.length();
while (i < len1 && j <= len2) {
if (j == -1 || s1[i] == s2[j]) i++, j++;
else j = nxt[j];
if (j == len2) { cnt++; j = nxt[j]; }
}
return cnt;
}
int main() {
// RE
std::ios::sync_with_stdio(false);
int t;
string s, p;
cin >> t;
while (t--) {
cin >> p >> s;
cout << kmp(s,p) << endl;
}
return 0;
}
HDU 2594 Simpsons’ Hidden Talents
题意:给定字符串s1和s2,求s1的最长前缀S,这个S是s2的后缀
思路:
将s1和s2连起来,且用不会出现的字符隔开,得到长度为N的新串,求新串KMP里的next数组,答案就是next[N]
next[i]代表了以s[i-1]为结尾的满足前缀串和后缀串相同的最长字符串的长度(如acbacb: 最后个b下标为5,则next[5]=2,因为最前面有ac,b的前2个也是ac)
之所以要隔开,是防止next[]的值大于min(s1长度,s2长度),求得的S长度肯定最多是min(s1长度,s2长度)【如s1=aaa,s2=aaa】
#include <cstdio>
#include <cmath>
#include <cstring>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define eps 10^(-6)
#define Q_CIN ios::sync_with_stdio(false)
#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define FOR( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define CLR( a , x ) memset ( a , x , sizeof (a) )
#define RE freopen("1.in","r",stdin);
#define WE freopen("1.out","w",stdout);
#define MOD 10009
#define NMAX 10002
#define min(a,b) ((a)>(b)?(b):(a))
#define max(a,b) ((a)<(b)?(b):(a))
int next[50005<<1];
void get_next(string s1)
{
int i=-1;
int j=0;
next[0]=-1;
int len=s1.length();
while(j<len)
{
if(i==-1||s1[i]==s1[j])
next[++j]=++i;
else
i=next[i];
}
}
int main()
{
string s1,s2,s3;
while(cin>>s1>>s2)
{
s3=s1+"#"+s2; //防止next[]>min(len1,len2)
get_next(s3);
int len1=s1.length();
int len2=s2.length();
int len3=len1+len2+1;
int ans=0;
ans=next[len3];
// FOR(i,len1,len3) cout<<next[i]<<" ";
if(!ans)
{
cout<<ans<<endl;
continue;
}
REP(i,ans)
cout<<s1[i];
cout<<" "<<ans<<endl;
}
return 0;
}
题意:串S由某个串T重复K次得来,求K(不求T)
思路:假设子串T重复K次后得到串S,那么T的长度一定为L = N/K(要整除),则T = S[1...L],将S拆分成K份,每份长度为L,则有
S[1...L] = S[L+1...2L] = S[2L+1...3L] = ... = S[(K-1)L+1...KL]
由于要保证K最大,势必L要取最小,所以根据Next函数的定义,有Next[KL] = (K-1)L;
即Next[N] = N - L,所以L = N - Next[N];
但是得出的长度L还要保证能被N整除,所以如果不能整除说明L = N,即K = 1;而如果能整除,那么K = N / (N - Next[N]);
/****** 此处直接使用 英雄哪里出来的博客 ********/
【aabaabaa应为1,如果不判断整除则错误答案为2】
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define eps 10^(-6)
#define Q_CIN ios::sync_with_stdio(false)
#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define FOR( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define CLR( a , x ) memset ( a , x , sizeof (a) )
#define RE freopen("1.in","r",stdin);
#define WE freopen("1.out","w",stdout);
#define MOD 10009
#define NMAX 10002
#define min(a,b) ((a)>(b)?(b):(a))
#define max(a,b) ((a)<(b)?(b):(a))
int next[1000005];
void get_next(string s1)
{
int i=-1;
int j=0;
next[0]=-1;
int len=s1.length();
while(j<len)
{
if(i==-1||s1[i]==s1[j])
next[++j]=++i;
else
i=next[i];
}
}
int main()
{
string s1;
ios::sync_with_stdio(false);
while(cin>>s1,s1!=".")
{
get_next(s1);
int len=s1.length();
int L=len-next[len];
int K=len/L;
if(len%L)
K=1;
cout<<K<<endl;
}
return 0;
}
PKU 2752 Seek the Name, Seek the Fame
题意:求前缀=后缀的子串长度
思路:Next数组直接上,从Next[N]起Next[Next[N]]下去,可用栈实现,这里我用递归。同时,此题也可以理解为求回文子串长度
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define eps 10^(-6)
#define Q_CIN ios::sync_with_stdio(false)
#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define FOR( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define CLR( a , x ) memset ( a , x , sizeof (a) )
#define RE freopen("1.in","r",stdin);
#define WE freopen("1.out","w",stdout);
#define MOD 10009
#define NMAX 10002
#define min(a,b) ((a)>(b)?(b):(a))
#define max(a,b) ((a)<(b)?(b):(a))
int next[400005];
void get_next(string s1)
{
int i=-1;
int j=0;
next[0]=-1;
int len=s1.length();
while(j<len)
{
if(i==-1||s1[i]==s1[j])
next[++j]=++i;
else
i=next[i];
}
}
void print(int ans)
{
if(ans>0)
{
print(next[ans]);
cout<<ans<<" ";
}
}
int main()
{
RE
string s1;
ios::sync_with_stdio(false);
while(cin>>s1)
{
get_next(s1);
int len=s1.length();
print(next[len]);
cout<<len<<endl;
}
return 0;
}
题意:给一个字符串,要求将字符串的全部字符最少循环2次需要添加的字符数。
例子:
abcabc 已经循环2次,添加数为0
abcac 没有循环2次,添加字符abcac。数目为5.
abcabcab 已经循环过2次,但第三次不完整,需要添加数为1。
#include<stdio.h>
#include<string.h>
int len;
char p[100003];
int next[100003];
void getnext(char *p,int *next)
{
int j,k;
next[0] = -1;
j = 0;
k = -1;
while( j < len )
{
if( k == -1 || p[j] == p[k])
{
next[++j] = ++k;
}
else
k = next[k];
}
}
int main()
{
int time;
// freopen("a.txt","r",stdin);
scanf("%d",&time);
while(time--)
{
scanf("%s",p);
len = strlen(p);
getnext(p,next);
if( len%(len-next[len]) == 0 && len != len-next[len])
puts("0");
else
printf("%d\n",len-next[len]-len%(len-next[len]));
}
return 0;
}