S
o
u
r
c
e
:
Source:
Source:Common Substrings
P
r
o
b
l
e
m
:
Problem:
Problem:求AB两个字符串的公共子串长度>=k的数量
I
d
e
a
:
Idea:
Idea:
基础的后缀自动机操作。
对A建sam,B串通过失配跑最长公共子串,在lcs>=k时即使更新答案,方便处理,并对父亲打上lazy标志,因为fail边上每个节点的right大小都是不同的,不能一次性更新。dp[u]表示该状态在B串中出现了几次,sam基数排序后跑Parent树dp,right[u]*dp[u]即每个状态对答案的贡献次数,最后再乘上该状态可用的子串数量即可。
C o d e : Code: Code:
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define CLR(A, X) memset(A, X, sizeof(A))
typedef long long LL;
const int N = 2e5+10;
struct SAM {
int last, sz;
int ch[N][52], len[N], f[N], ed[N], c[N], q[N]; // N两倍大小
LL dp[N];
int idx(char ch) {
if(ch>='A' && ch<='Z') return ch-'A';
return ch-'a'+26;
}
void init(int n) {
n *= 2;
CLR(ch[1], 0);
for(int i = 0; i <= n; i++) {
ed[i] = c[i] = dp[i] = 0;
}
last = sz = 1;
f[1] = len[1] = 0;
}
void Insert(int c) {
int p = last, np = last = ++sz;
CLR(ch[np], 0);
len[np] = len[p] + 1; ed[np] = 1;
while(!ch[p][c] && p) ch[p][c] = np, p = f[p];
if(!p) f[np] = 1;
else {
int q = ch[p][c];
if(len[q] == len[p]+1) f[np] = q;
else {
int nq = ++sz;
len[nq] = len[p]+1;
memcpy(ch[nq], ch[q], sizeof(ch[q]));
f[nq] = f[q]; f[np] = f[q] = nq;
while(p && ch[p][c]==q) ch[p][c] = nq, p = f[p];
}
}
}
void build(char *s) {
int n = strlen(s);
init(n);
for(int i = 0; i < n; i++) Insert(idx(s[i]));
for(int i = 1; i <= sz; i++) c[len[i]]++;
for(int i = 1; i <= sz; i++) c[i] += c[i-1];
for(int i = sz; i >= 1; i--) q[c[len[i]]--] = i;
for(int i = sz; i >= 1; i--) ed[f[q[i]]] += ed[q[i]];
}
LL solve(char *s, int K) {
int n = strlen(s), u = 1, lcs = 0;
LL ans = 0;
for(int i = 0; i < n; i++) {
int t = idx(s[i]);
while(u!=1 && !ch[u][t]) u = f[u], lcs = len[u];
if(ch[u][t]) {
lcs++;
u = ch[u][t];
if(lcs >= K) {
dp[f[u]]++;
ans += 1LL*ed[u]*(lcs-max(K-1, len[f[u]]));
}
}
}
for(int i = sz; i >= 1; i--) {
int u = q[i];
if(len[u] >= K) ans += dp[u]*ed[u]*(len[u]-max(K-1, len[f[u]]));
dp[f[u]] += dp[u];
}
return ans;
}
}A;
char sa[N], sb[N];
int main() {
int K;
while(~scanf("%d", &K)) {
if(K == 0) break;
scanf("%s%s", sa, sb);
A.build(sa);
printf("%lld\n", A.solve(sb, K));
}
return 0;
}