题目地址:
https://www.luogu.com.cn/problem/P3181
题目描述:
给定两个字符串,求出在两个字符串中各取出一个子串使得这两个子串相同的方案数。两个方案不同当且仅当这两个子串中有一个位置不同。
输入格式:
两行,两个字符串
s
1
,
s
2
s_1,s_2
s1,s2,长度分别为
n
1
,
n
2
n_1,n_2
n1,n2。
输出格式:
输出一个整数表示答案。
数据范围:
1
≤
n
1
,
n
2
≤
2
×
1
0
5
1\le n_1,n_2\le 2\times 10^5
1≤n1,n2≤2×105,字符串中只有小写字母。
首先,考虑同一个字符串内有多少对相同的子串呢?先求后缀数组和高度数组,由于所有的子串都是某个后缀的前缀,所以其实就是问两个后缀的相同前缀总数是多少。设 l c p ( i , j ) lcp(i,j) lcp(i,j)是字典序排名第 i i i和第 j j j的后缀的最长公共前缀长度,那么这两个后缀提供的重复子串个数就是 l c p ( i , j ) lcp(i,j) lcp(i,j),所以答案就是 ∑ 1 ≤ i < j ≤ n l c p ( i , j ) \sum_{1\le i<j\le n}lcp(i,j) ∑1≤i<j≤nlcp(i,j),再由 l c p lcp lcp性质,知道: ∑ 1 ≤ i < j ≤ n l c p ( i , j ) = ∑ 1 ≤ i < j ≤ n min h [ i : j ] \sum_{1\le i<j\le n}lcp(i,j)=\sum_{1\le i<j\le n}\min h[i:j] 1≤i<j≤n∑lcp(i,j)=1≤i<j≤n∑minh[i:j]即高度数组 h h h的所有的区间最小值之和,这可以用单调栈来做(单调上升栈)。
接下来考虑原题,原题是要找两个字符串 s s s和 t t t的公共子串的对数,那么可以先对求 s + ‘ ∗ ’ + t s+‘*’+t s+‘∗’+t这个新串求公共子串的对数,再减去 s s s和 t t t各自内部的重复子串对数即可。注意,这里 s s s和 t t t之间要夹一个特殊字符,来标记 s s s的结束。代码如下:
#include <iostream>
#include <cstring>
using namespace std;
const int N = 4e5 + 10;
int n, m;
char s[N], s2[N];
int sa[N], rk[N], y[N], c[N], he[N];
int stk[N], top;
void get_sa(char s[]) {
for (int i = 1; i <= n; i++) c[rk[i] = s[i]]++;
for (int i = 2; i <= m; i++) c[i] += c[i - 1];
for (int i = n; i; i--) sa[c[rk[i]]--] = i;
for (int k = 1;; k <<= 1) {
int num = 0;
for (int i = n - k + 1; i <= n; i++) y[++num] = i;
for (int i = 1; i <= n; i++) if (sa[i] > k) y[++num] = sa[i] - k;
for (int i = 1; i <= m; i++) c[i] = 0;
for (int i = 1; i <= n; i++) c[rk[i]]++;
for (int i = 2; i <= m; i++) c[i] += c[i - 1];
for (int i = n; i; i--) sa[c[rk[y[i]]]--] = y[i];
swap(rk, y);
rk[sa[1]] = num = 1;
for (int i = 2; i <= n; i++)
rk[sa[i]] = y[sa[i]] == y[sa[i - 1]] && y[sa[i] + k] == y[sa[i - 1] + k] ? num : ++num;
if (num == n) break;
m = num;
}
}
void get_height(char s[]) {
for (int i = 1, k = 0; i <= n; i++) {
if (rk[i] == 1) continue;
if (k) k--;
int j = sa[rk[i] - 1];
while (i + k <= n && j + k <= n && s[i + k] == s[j + k]) k++;
he[rk[i]] = k;
}
}
long calc() {
long res = 0;
for (int i = 2; i <= n; i++) {
while (top && he[stk[top - 1]] >= he[i]) {
int x = stk[--top];
int left = x - (top ? stk[top - 1] : 1), right = i - x;
res += (long) left * right * he[x];
}
stk[top++] = i;
}
while (top) {
int x = stk[--top];
int left = x - (top ? stk[top - 1] : 1), right = n + 1 - x;
res += (long) left * right * he[x];
}
return res;
}
int main() {
scanf("%s", s + 1);
long res = 0;
n = strlen(s + 1), m = 'z';
int n1 = n;
get_sa(s);
get_height(s);
res -= calc();
memset(c, 0, sizeof c);
scanf("%s", s2 + 1);
n = strlen(s2 + 1), m = 'z';
get_sa(s2);
get_height(s2);
res -= calc();
n = n1;
s[++n] = '$';
for (int k = 1; s2[k]; n++, k++) s[n + 1] = s2[k];
s[n + 1] = 0;
memset(c, 0, sizeof c);
get_sa(s);
get_height(s);
res += calc();
printf("%ld\n", res);
}
时间复杂度 O ( ( n 1 + n 2 ) log ( n 1 + n 2 ) ) O((n_1+n_2)\log (n_1+n_2)) O((n1+n2)log(n1+n2)),空间 O ( n 1 + n 2 ) O(n_1+n_2) O(n1+n2)。