是真的只是模板了,暂时没办法完全理解代码实现。
Distinct Substrings
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#define LL long long
using namespace std;
const int maxn = 1e5;
char str[maxn + 5], s[maxn + 5];
int n, m, rk[maxn + 5], tp[maxn + 5], tax[maxn + 5], sa[maxn + 5], height[maxn + 5];
//rk为第i个后缀的排名,sa为排名为i的后缀,tax用于sort辅助排序,tp为rk的辅助数组,记录第二关键字的排名为i的后缀,height为lcp
void Sort(){//更新sa
for(int i = 0; i <= m; i++) tax[i] = 0;
for(int i = 1; i <= n; i++) tax[rk[tp[i]]] ++;
for(int i = 1; i <= m; i++) tax[i] += tax[i - 1];
for(int i = n; i >= 1; i--) sa[tax[rk[tp[i]]]--] = tp[i];
}
bool cmp(int f[], int x, int y, int w){//根据第一关键字和第二关键字比较
return f[x] == f[y] && f[x + w] == f[y + w];
}
void Suffix(){
//sa
for(int i = 1; i <= n; i++) rk[i] = s[i], tp[i] = i;
m = 127;//字符集
Sort();
for(int w = 1, p = 1, i; p < n; w <<= 1, m = p){//倍增更新rk
//w为当前比较长度,m为离散rk后排名种类
for(p = 0, i = n - w + 1; i <= n; i++){
tp[++p] = i;//将长度越界的第二关键字设为0
}
for(int i = 1; i <= n; i++){
if(sa[i] > w) tp[++p] = sa[i] - w;
}
Sort();//更新sa
swap(rk, tp);//用tp储存上一轮rk
rk[sa[1]] = p = 1;
for(int i = 2; i <= n; i++) rk[sa[i]] = cmp(tp, sa[i], sa[i - 1], w) ? p : ++p;
}
//height
int j, k = 0;
for(int i = 1 ; i <= n; i++){
if(k) k--;
j = sa[rk[i] - 1];
while(s[i + k] == s[j + k]) k++;
height[rk[i]] = k;
}
}
int main(){
int t; scanf("%d", &t);
while(t--){
LL ans = 0;
scanf("%s", str);
n = strlen(str);
for(int i = 0; i < n; i++) s[i + 1] = str[i];//从1开始
Suffix();//计算sa和height
for(int i = 1; i <= n; i++){
ans += 1LL * n + 1LL - sa[i] - height[i];
}
printf("%d\n", ans);
}
return 0;
}