int cntA[MAXN],cntB[MAXN],sa[MAXN],tsa[MAXN],Rank[MAXN],A[MAXN],B[MAXN],height[MAXN];
void build_sa(char* ch,int n) {
for (int i = 0; i < 256; i ++) cntA[i] = 0;
for (int i = 1; i <= n; i ++) cntA[ch[i]] ++;
for (int i = 1; i < 256; i ++) cntA[i] += cntA[i - 1];
for (int i = n; i; i --) sa[cntA[ch[i]] --] = i;
Rank[sa[1]] = 1;
for (int i = 2; i <= n; i ++) {
Rank[sa[i]] = Rank[sa[i - 1]];
if (ch[sa[i]] != ch[sa[i - 1]]) Rank[sa[i]] ++;
}
for (int l = 1; Rank[sa[n]] < n; l <<= 1) {
for (int i = 0; i <= n; i ++) cntA[i] = 0;
for (int i = 0; i <= n; i ++) cntB[i] = 0;
for (int i = 1; i <= n; i ++) {
cntA[A[i] = Rank[i]] ++;
cntB[B[i] = (i + l <= n) ? Rank[i + l] : 0] ++;
}
for (int i = 1; i <= n; i ++) cntB[i] += cntB[i - 1];
for (int i = n; i; i --) tsa[cntB[B[i]] --] = i;
for (int i = 1; i <= n; i ++) cntA[i] += cntA[i - 1];
for (int i = n; i; i --) sa[cntA[A[tsa[i]]] --] = tsa[i];
Rank[sa[1]] = 1;
for (int i = 2; i <= n; i ++) {
Rank[sa[i]] = Rank[sa[i - 1]];
if (A[sa[i]] != A[sa[i - 1]] || B[sa[i]] != B[sa[i - 1]]) Rank[sa[i]] ++;
}
}
for (int i = 1, j = 0; i <= n; i ++) {
if (j) j --;
while (ch[i + j] == ch[sa[Rank[i] - 1] + j]) j ++;
height[Rank[i]] = j;
}
}
空间优化版:
int sa[MAXN], Rank[MAXN], height[MAXN];
int wa[MAXN], wb[MAXN], wv[MAXN], wd[MAXN];
int cmp(int *r, int a, int b, int l){
return r[a] == r[b] && r[a+l] == r[b+l];
}
void da(char *r, int n, int m){ // 倍增算法 r为待匹配数组 n为总长度,n要+1 m为字符范围
int i, j, p, *x = wa, *y = wb, *t;
for(i = 0; i < m; i ++) wd[i] = 0;
for(i = 0; i < n; i ++) wd[x[i]=r[i]] ++;
for(i = 1; i < m; i ++) wd[i] += wd[i-1];
for(i = n-1; i >= 0; i --) sa[-- wd[x[i]]] = i;
for(j = 1, p = 1; p < n; j *= 2, m = p){
for(p = 0, i = n-j; i < n; i ++) y[p ++] = i;
for(i = 0; i < n; i ++) if(sa[i] >= j) y[p ++] = sa[i] - j;
for(i = 0; i < n; i ++) wv[i] = x[y[i]];
for(i = 0; i < m; i ++) wd[i] = 0;
for(i = 0; i < n; i ++) wd[wv[i]] ++;
for(i = 1; i < m; i ++) wd[i] += wd[i-1];
for(i = n-1; i >= 0; i --) sa[-- wd[wv[i]]] = y[i];
for(t = x, x = y, y = t, p = 1, x[sa[0]] = 0, i = 1; i < n; i ++){
x[sa[i]] = cmp(y, sa[i-1], sa[i], j) ? p - 1: p ++;
}
}
}
void calHeight(char *r, int n){ // 求height数组。n不用+1
int i, j, k = 0;
for(i = 1; i <= n; i ++) Rank[sa[i]] = i;
for(i = 0; i < n; height[Rank[i ++]] = k){
for(k ? k -- : 0, j = sa[Rank[i]-1]; r[i+k] == r[j+k]; k ++);
}
}