【*】后缀数组（初步接触）

有点难以理解，大概知道意思。需要日后深入研究。

const int Max = 20001;  
int num[Max];
int sa[Max], rank[Max], height[Max];
int wa[Max], wb[Max], wv[Max], wd[Max];

int cmp(int *r, int a, int b, int l) {
	return r[a] == r[b] && r[a+l] == r[b+l]; 
}
//Doubling Algorithm, r为待匹配数组，n为总长度，m为字符范围
void da(int *r, int n, int m)
{
	int i, j, p, *x = wa, *y = wb, *t;//wd是为了方便计算sa1的辅助数组
	for (i = 0; i < m; ++i) wd[i] = 0;
	for (i = 0; i < n; ++i) wd[x[i] = r[i]]++;
	for (i = 0; i < n; ++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(int *r, int n) {//求height数组。
    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++);
    }
}
/*这里num[0, n-1]为有效值,就是输入的字符串稍稍转化而成的数组
  sa[1~n]为有效值,sa[i]=a则代表排在第i位的是第a个后缀。a属于[0~~n-1]
  rank[0~~n-1]是有效值  rank[i]=b则代表第 i 个后缀排在第b位   b属于[1~~n]
  height[2~~n]是有效值  height[i]=c 则代表排在第 i 位的后缀和排在第i-1的后缀的最长前缀长度是c。
*/
int main()
{
	char s[Max];
	int i, m = 30, ans, len;
	/*while (gets(s) != NULL)*/ {
		strcpy(s, "aabaaaab");
		len = strlen(s);
		for (i = 0; i < len; ++i) num[i] = s[i] - 'a' + 1;
		num[len] = 0;
		da(num, len + 1, m);
        calHeight(num, len);
        printf("num: \n");
        for(i=0;i<=len;i++){printf("%d ",num[i]);}printf("\n");
        printf("sa: \n");
        for(i=0;i<=len;i++){printf("%d ",sa[i]);}printf("\n");
        printf("rank: \n");
        for(i=0;i<=len;i++){printf("%d ",rank[i]);}printf("\n");
        printf("height: \n");
        for (i = 0;i <= len; i++){printf("%d ",height[i]);}printf("\n");
    }
    return 0;
}