给出一个文本串s,100个模式串,每个模式串长度不超过1000,求有几个满足存在 a < = b < c = d a<=b<c=d a<=b<c=d,使得 s [ a . . b ] + s [ c . . d ] = t s[a..b]+s[c..d]=t s[a..b]+s[c..d]=t,先求一遍模式串前缀最左出现位置,存起来,再倒着来一遍,求后缀最优出现位置,不能判断时看看是否相交。
const int N = 1e5 + 5;
int nxt[N];
char s[N], ins[N];
char tmp[1005], itmp[1005];
int mp[1005];
void getnxt(char s[])
{
nxt[0] = nxt[1] = 0;
int len = strlen(s);
for (int i = 1;i <len;i++)
{
int j = nxt[i];
while (j && s[i] != s[j]) j = nxt[j];
nxt[i + 1] = s[i] == s[j] ? j + 1 : 0;
}
}
bool kmp(char s1[], char s2[],int fg)
{
getnxt(s1);
int ans = -1;
int n =strlen(s1), m = strlen(s2);
for (int i = 0, j = 0;i < m;i++)
{
while (j && s1[j] != s2[i]) j = nxt[j];
if (s1[j] == s2[i]) j++;
if (fg == 1 && mp[j] == -1 && j > 0)mp[j] =m-(i-j+2+(j-1))+1;
if (fg == 2 && (mp[n - j] != -1) && j > 0)
{
int u = mp[n - j];
int nowpos = i - j + 2 + (j - 1);
if (nowpos <=u - 1)return true;
}
}
return false;
}
int main()
{
//freopen("in.txt", "r", stdin);
scanf("%s", s);
int n = strlen(s);
f(i, 0, n - 1)ins[i] = s[n - 1 - i];ins[n] = '\0';
int q = in();
int ans = 0;
while (q--)
{
scanf("%s", tmp);
int m = strlen(tmp);
f(i, 0, m + 1)mp[i] = -1;
kmp(tmp, s, 1);
f(i, 0, m - 1)itmp[i] = tmp[m - 1 - i];itmp[m] = '\0';
if (kmp(itmp, ins, 2))ans++;
}
cout << ans << endl;
return 0;
}