模板积累——后缀数组（最长公共子串、回文、子串个数）

#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn=1000+7;
char s[maxn];
int sa[maxn], t[maxn], t2[maxn], c[maxn], rk[maxn], height[maxn];
void build_sa(int m, int n)
{ //n为字符串的长度,字符集的值为0~m-1
    n++;
    int *x = t, *y = t2;
    //基数排序
    for (int i = 0; i < m; i++) c[i] = 0;
    for (int i = 0; i < n; i++) c[x[i] = s[i]]++;
    for (int i = 1; i < m; i++) c[i] += c[i - 1];
    for (int i = n - 1; ~i; i--) sa[--c[x[i]]] = i;
    for (int k = 1; k <= n; k <<= 1)
    { //直接利用sa数组排序第二关键字
        int p = 0;
        for (int i = n - k; i < n; i++) y[p++] = i;
        for (int i = 0; i < n; i++)
            if (sa[i] >= k) y[p++] = sa[i] - k;
        //基数排序第一关键字
        for (int i = 0; i < m; i++) c[i] = 0;
        for (int i = 0; i < n; i++) c[x[y[i]]]++;
        for (int i = 1; i < m; i++) c[i] += c[i - 1];
        for (int i = n - 1; ~i; i--) sa[--c[x[y[i]]]] = y[i];
        //根据sa和y数组计算新的x数组
        swap(x, y);
        p = 1;
        x[sa[0]] = 0;
        for (int i = 1; i < n; i++)
            x[sa[i]] = y[sa[i - 1]] == y[sa[i]] && y[sa[i - 1] + k] == y[sa[i] + k] ? p - 1 : p++;
        if (p >= n) break; //以后即使继续倍增，sa也不会改变，推出
        m = p;             //下次基数排序的最大值
    }
    n--;
    int k = 0;
    for (int i = 0; i <= n; i++) rk[sa[i]] = i;
    for (int i = 0; i < n; i++)
    {
        if (k) k--;
        int j = sa[rk[i] - 1];
        while (s[i + k] == s[j + k]) k++;
        height[rk[i]] = k;
    }
}
int dp[maxn][30];
void initrmq(int n)
{
    for (int i = 1; i <= n; i++)
        dp[i][0] = height[i];
    for (int j = 1; (1 << j) <= n; j++)
        for (int i = 1; i + (1 << j) - 1 <= n; i++)
            dp[i][j] = min(dp[i][j - 1], dp[i + (1 << (j - 1))][j - 1]);
}
int rmq(int l, int r)
{
	int k = 31 - __builtin_clz(r - l + 1);
    return min(dp[l][k], dp[r - (1 << k) + 1][k]);
}
int lcp(int a, int b)
{ // 求两个后缀的最长公共前缀
    a = rk[a], b = rk[b];
    if (a > b) swap(a, b);
    return rmq(a + 1, b);
}
int main(){//求回文的主函数
	while(~scanf("%s",s)){
		int len1=strlen(s);
		s[len1]='$';
		for(int i=1;i<=len1;i++){
			s[len1+i]=s[len1-i];
		}
		s[2*len1+1]='\0';
		int len=strlen(s);
		build_sa(128,len);
		initrmq(len);
		int pos=0;
		int ans=0;
		for(int i = 0; i < len1; i++){
	        int tmp = lcp(i, len - i - 1);
	        if(tmp * 2 - 1 > ans){
	            ans= tmp * 2 - 1;
	            pos = i - tmp + 1;
	        }
	        tmp = lcp(i, len - i);
	        if(tmp * 2 > ans){
	            ans = tmp * 2;
	            pos = i - tmp;
	        }
	    }
	    for(int i=0;i<ans;i++){
	    	cout<<s[pos+i];
		}
		cout<<endl;
	}
		
	return 0;
}

int main(){//求最长公共子串的主函数
	char s1[maxn],s2[maxn];
	scanf("%s%s",s1+1,s2+1);
	int len1=strlen(s1+1);
	strcat(s1+1, "$");
    strcat(s1+1, s2+1);
    strcpy(s,s1+1);
	int len=strlen(s);
	build_sa(128,len);
	initrmq(len);
	int res = 0;
	
    for(int i = 1; i <= len; i++)
        if((sa[i - 1] < len1 && sa[i] >= len1) || (sa[i - 1] >= len1 && sa[i] < len1)){
        	res = max(res, height[i]);
		}
    printf("%d\n", res);
	return 0;
}
int main(){//求子串个数的主函数
	int t;
	cin>>t;
	while(t--){
		scanf("%s",s);
		int len=strlen(s);
		build_sa(128,len);
		initrmq(len);
		int ans=len*(len+1)/2;
		for(int i=0;i<=len;i++){
			ans-=height[i];
		}
		cout<<ans<<endl;
	} 
	return 0;
}