【HDU】5906 Square Revolution【后缀数组+RMQ求LCP+并查集+扫描线+树状数组】【求以某个点为开始或者结尾的最短AA形式串的长度】

题目链接：Square Revolution

题意：求串s有多少个子串满足不存在形式为AA的前缀或后缀（其中A是一个字符串）。

本质是求以某个点为起点或者终点的最短AA串的长度。求出这东西以后就可以询问离线+扫描线树状数组搞搞了。

求最短AA串怎么求呢，我们枚举A的长度k，然后看i和i+k的lcp（最长公共前缀）和lcs（最长公共后缀）是否加起来大于等于k，是的话用他们更新一下被影响的每个点的信息（即以他们开始或结尾的最短AA串长度）。考虑到我们从小到大枚举k，那么被第二次更新肯定是没用的，所以并查集缩点，可以少掉一个线段树。

#include <bits/stdc++.h>
using namespace std ;

typedef long long LL ;
typedef pair < int , int > pii ;

#define clr( a , x ) memset ( a , x , sizeof a )

const int MAXN = 200005 ;
const int LOGF = 20 ;

int sa[MAXN] , rnk[MAXN] , height[MAXN] ;
int t1[MAXN] , t2[MAXN] , xy[MAXN] , c[MAXN] ;

char s[MAXN] ;
int dp[MAXN][LOGF] , logn[MAXN] ;
int st[MAXN] , ed[MAXN] , p1[MAXN] , p2[MAXN] ;
int T[MAXN] ;
vector < pii > G[MAXN] ;
int n , m ;

int cmp ( int* r , int a , int b , int d ) {
    return r[a] == r[b] && r[a + d] == r[b + d] ;
}

void get_height ( int n , int k = 0 ) {
    for ( int i = 0 ; i <= n ; ++ i ) rnk[sa[i]] = i ;
    for ( int i = 0 ; i < n ; ++ i ) {
        if ( k ) -- k ;
        int j = sa[rnk[i] - 1] ;
        while ( s[i + k] == s[j + k] ) ++ k ;
        height[rnk[i]] = k ;
    }
}

void da ( int n , int m ) {
    int *x = t1 , *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 >= 0 ; -- i ) sa[-- c[x[i]]] = i ;
    for ( int d = 1 , p = 0 ; p < n ; d <<= 1 , m = p ) {
        p = 0 ;
        for ( int i = n - d ; i < n ; ++ i ) y[p ++] = i ;
        for ( int i = 0 ; i < n ; ++ i ) if ( sa[i] >= d ) y[p ++] = sa[i] - d ;
        for ( int i = 0 ; i < m ; ++ i ) c[i] = 0 ;
        for ( int i = 0 ; i < n ; ++ i ) c[xy[i] = x[y[i]]] ++ ;
        for ( int i = 1 ; i < m ; ++ i ) c[i] += c[i - 1] ;
        for ( int i = n - 1 ; i >= 0 ; -- i ) sa[-- c[xy[i]]] = y[i] ;
        swap ( x , y ) ;
        p = 0 ;
        x[sa[0]] = p ++ ;
        for ( int i = 1 ; i < n ; ++ i ) x[sa[i]] = cmp ( y , sa[i - 1] , sa[i] , d ) ? p - 1 : p ++ ;
    }
    get_height ( n - 1 ) ;
}

void init_rmq ( int n ) {
    for ( int i = 1 ; i <= n ; ++ i ) dp[i][0] = height[i] ;
    logn[1] = 0 ;
    for ( int i = 2 ; i <= n ; ++ i ) logn[i] = logn[i - 1] + ( i == ( i & -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 ) {
    L = rnk[L] , R = rnk[R] ;
    if ( L > R ) swap ( L , R ) ;
    ++ L ;
    int k = logn[R - L + 1] ;
    return min ( dp[L][k] , dp[R - ( 1 << k ) + 1][k] ) ;
}

int F ( int p[] , int x ) {
    return p[x] == x ? x : ( p[x] = F ( p , p[x] ) ) ;
}

void Union ( int L , int R , int v , int f ) {
    if ( f == 0 ) {
        for ( int i = L ; i <= R ; ++ i ) {
            int x = F ( p1 , i ) ;
            int y = F ( p1 , R + 1 ) ;
            if ( x != y ) {
                p1[x] = y ;
                st[x] = v ;
            }
            i = x ;
        }
    } else {
        for ( int i = L ; i <= R ; ++ i ) {
            int x = F ( p2 , i ) ;
            int y = F ( p2 , R + 1 ) ;
            if ( x != y ) {
                p2[x] = y ;
                ed[x] = v ;
            }
            i = x ;
        }
    }
}

void add ( int x , int v ) {
    if ( x == 0 ) T[0] += v ;
    else {
        for ( int i = x ; i <= n ; i += i & -i ) {
            T[i] += v ;
        }
    }
}

int sum ( int x , int ans = 0 ) {
    ans += T[0] ;
    for ( int i = x ; i ; i -= i & -i ) {
        ans += T[i] ;
    }
    return ans ;
}

void solve () {
    scanf ( "%s" , s ) ;
    n = strlen ( s ) ;
    s[n] = '#' ;
    int m = n + 1 ;
    for ( int i = 0 ; i < n ; ++ i ) {
        s[m ++] = s[n - i - 1] ;
    }
    s[m] = 0 ;
    da ( m + 1 , 128 ) ;
    init_rmq ( m ) ;
    for ( int i = 0 ; i <= n ; ++ i ) {
        st[i] = ed[i] = n + 5 ;
        G[i].clear () ;
        T[i] = 0 ;
    }
    for ( int i = 0 ; i <= n ; ++ i ) {
        p1[i] = p2[i] = i ;
    }
    for ( int i = 1 ; i <= n / 2 ; ++ i ) {
        for ( int j = 0 , k = i ; 2 * n - j > n && 2 * n - k > n ; j += i , k += i ) if ( s[j] == s[k] ) {
            int x = rmq ( 2 * n - j , 2 * n - k ) ;
            int L = j - x + 1 ;
            int R = k - x + 1 ;
            int len = rmq ( L , R ) ;
            if ( len >= i ) {
                Union ( L , L + len - i , i * 2 , 0 ) ;
                Union ( R + i - 1 , R + len - 1 , i * 2 , 1 ) ;
            }
        }
    }
    for ( int i = n ; i >= 1 ; -- i ) {
        st[i] = st[i - 1] ;
        ed[i] = ed[i - 1] ;
        G[i - 1].push_back ( pii ( ( i - 1 ) << 1 | 0 , i ) ) ;
        G[min ( i + st[i] - 2 , n )].push_back ( pii ( ( i - 1 ) << 1 | 1 , i ) ) ;
    }
    LL ans = 0 ;
    for ( int i = 1; i <= n ; ++ i ) {
        add ( max ( i - ed[i] + 1 , 0 ) , 1 ) ;
        for ( int j = 0 ; j < G[i].size () ; ++ j ) {
            int v = G[i][j].first >> 1 , f = G[i][j].first & 1 ;
            if ( !f ) ans -= sum ( v ) ;
            if ( f ) ans += sum ( v ) ;
        }
    }
    printf ( "%I64d\n" , ans ) ;
}

int main () {
    int T ;
    scanf ( "%d" , &T ) ;
    for ( int i = 1 ; i <= T ; ++ i ) {
        solve () ;
    }
    return 0 ;
}