kmp算法模板

#include<iostream>
#include<cstring>
#include<string>
using namespace std;

const int maxn=10011;

int tot;
int ans[101];

void kmp(string a,string b)
{
	int i,j;
	int fail[maxn];             //這裏的fail就是常說的next
	j=-1;
	memset(fail,-1,sizeof(fail));
	for(i=1;i<a.length();i++)
	{
		while(j>-1 && a[j+1]!=a[i]) j=fail[j];
		if(a[j+1]==a[i]) j++;
		fail[i]=j;
	}
	j=-1; tot=0;
	for(i=0;i<b.length();i++)
	{
		while(j>-1 && a[j+1]!=b[i]) j=fail[j];
		if(a[j+1]==b[i]) j++;
		if(j==a.length()-1)
		{
			tot++;
			ans[tot]=i-a.length()+1;
			j=fail[j];
		}
	}       
}

int main()
{
	int T;
	string a,b;
	cin>>T;
	while(T--)
	{
		cin>>a>>b;          //a是模式串，b是主串	
		kmp(a,b);
		cout<<tot<<endl;
		for(int i=1;i<=tot;i++)
			cout<<ans[i]+1<<endl;
	}
	return 0;
}