HDU 3948 The Number of Palindromes（后缀数组）

题意：求一个串中不相同回文子串的个数。

做法：本来想用manacher。但是无法判重。只能利用后缀数组，按照求回文串常规做法，把原串翻转拼到原串后面，求出height，以及利用sparse table预处理。通过rank值的从小到大枚举回文串的中点（这里就说奇回文串，偶的大同小异），同时要保存之前算出的回文串长度（其实中心到右端）L，L = min(L, height[i])是当前求出回文串长度的分界线，因为前一个串是跟当前串相同是最多的，如果上一个算出L是6，当前的height[i]是7，那么说明前6个的回文串已经被算过了，当前回文串长度必须要大于6才能会出现不同的回文串，那么再去更新L。

AC代码：

#pragma comment(linker, "/STACK:102400000,102400000")
#include<cstdio>
#include<ctype.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<cstdlib>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<ctime>
#include<string.h>
#include<string>
#include<sstream>
#include<bitset>
using namespace std;
#define ll long long
#define ull unsigned long long
#define eps 1e-8
#define NMAX 1000000000
#define MOD 51123987
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define PI acos(-1)
#define ALL(x) x.begin(), x.end()
#define INS(x) inserter(x, x.end())
template<class T>
inline void scan_d(T &ret)
{
    char c;
    int flag = 0;
    ret=0;
    while(((c=getchar())<'0'||c>'9')&&c!='-');
    if(c == '-')
    {
        flag = 1;
        c = getchar();
    }
    while(c>='0'&&c<='9') ret=ret*10+(c-'0'),c=getchar();
    if(flag) ret = -ret;
}
template<class T> inline T Max(T a, T b){ return a > b ? a : b; }
template<class T> inline T Min(T a, T b){ return a < b ? a : b; }

const int maxn = 200000+10;
char ch[maxn];
int s[maxn],sa[maxn],t[maxn],t2[maxn],c[maxn];

void build_sa(int n, int m)
{
    int i, *x = t, *y = t2;
    for(i = 0; i < m; i++) c[i] = 0;
    for(i = 0; i < n; i++) c[x[i] = s[i]]++;
    for(i = 1; i < m; i++) c[i] += c[i-1];
    for(i = n-1; i >= 0; i--) sa[--c[x[i]]] = i;
    for(int k = 1; k <= n; k <<= 1)
    {
        int p = 0;
        for(i = n-k; i < n; i++) y[p++] = i;
        for(i = 0; i < n; i++) if(sa[i] >= k) y[p++] = sa[i]-k;
        for(i = 0; i < m; i++) c[i] = 0;
        for(i = 0; i < n; i++) c[x[y[i]]]++;
        for(i = 1; i < m; i++) c[i] += c[i-1];
        for(i = n-1; i >= 0; i--) sa[--c[x[y[i]]]] = y[i];
        swap(x,y);
        p = 1; x[sa[0]] = 0;
        for(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;
        m = p;
    }
}

int rk[maxn],height[maxn];
void getHeight(int n)
{
    int i,j,k = 0;
    for(i = 0; i < n; i++) rk[sa[i]] = i;
    for(i = 0; i < n; i++)
    {
        if(k) k--;
        if(rk[i] == 0) continue;
        int j = sa[rk[i]-1];
        while(s[i+k] == s[j+k]) k++;
        height[rk[i]] = k;
    }
}
int dp[maxn][23];
void init_RMQ(int n)
{
    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;
    if(l > r){k = l; l = r; r = k;}
    l++;
    k = (int)log2(r-l+1.0);
    return min(dp[l][k],dp[r-(1<<k)+1][k]);
}

int main()
{
#ifdef GLQ
    freopen("input.txt","r",stdin);
//    freopen("o.txt","w",stdout);
#endif
    int cas,cc = 1;
    scanf("%d",&cas);
    while(cas--)
    {
        scanf("%s",ch);
        int n = strlen(ch);
        for(int i = 0; i < n; i++)
            s[i] = ch[i]-'a';
        s[n] = 26;
        for(int i = 0; i < n; i++)
            s[2*n-i] = ch[i]-'a';
        s[2*n+1] = 27;
        n = 2*n+2;
//        for(int i = 0; i < n; i++)
//            cout<<s[i]<<" ";
//        cout<<endl;
//        cout<<s[5]<<" "<<s[n-5-1]<<endl;
        build_sa(n,28);
        getHeight(n);
        init_RMQ(n);
        int len1 = 0, len2 = 0;
//        cout<<n<<" "<<sa[9]<<" "<<sa[8]<<endl;
        ll ans = 0;
        for(int i = 0; i <= n-2; i++)//根据rk大小枚举
        {
            len1 = min(len1,height[i]);
            int j = RMQ(i,rk[n-sa[i]-2]);
//            if(i == 5) cout<<sa[i]<<" "<<j<<" "<<n-sa[i]-2<<" kao:"<<ans<<endl;
            if(j > len1)
            {
                ans += (ll)j-(ll)len1;
                len1 = j;
            }
            len2 = min(len2,height[i]);
            j = RMQ(i,rk[n-sa[i]-1]);
            if(j > len2)
            {
                ans += (ll)j-(ll)len2;
                len2 = j;
            }
        }
        printf("Case #%d: %I64d\n",cc++,ans);
    }
    return 0;
}