bzoj2534 Uva10829L-gap字符串(SA+lcp同bzoj2119)

求形如ABA的子串个数，同bzoj2119，题解看这里
tips:没说全是小写字母你就别换成int了。。。无谓的WA三发

#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
#define N 50010
int n,k,Log[N];
ll ans=0;
char s[N];
inline int min(int x,int y){return x<y?x:y;}
struct SA{
    char a[N];
    int rank[N<<1],rank1[N],sa[N],h[N],count[N],tmp[N];
    int m,st[N][18];
    void init(){
        m=300;
        for(int i=1;i<=m;++i) count[i]=0;
        for(int i=1;i<=n;++i) count[a[i]]=1;
        for(int i=1;i<=m;++i) count[i]+=count[i-1];
        for(int i=n;i>=1;--i) rank[i]=count[a[i]];
        int k=0;
        for(int p=1;k!=n;p<<=1,m=k){
            for(int i=1;i<=m;++i) count[i]=0;
            for(int i=1;i<=n;++i) count[rank[i+p]]++;
            for(int i=1;i<=m;++i) count[i]+=count[i-1];
            for(int i=n;i>=1;--i) tmp[count[rank[i+p]]--]=i;
            for(int i=1;i<=m;++i) count[i]=0;
            for(int i=1;i<=n;++i) count[rank[tmp[i]]]++;
            for(int i=1;i<=m;++i) count[i]+=count[i-1];
            for(int i=n;i>=1;--i) sa[count[rank[tmp[i]]]--]=tmp[i];
            memcpy(rank1,rank,sizeof(rank1));
            rank[sa[1]]=k=1;
            for(int i=2;i<=n;++i){
                if(rank1[sa[i]]!=rank1[sa[i-1]]||rank1[sa[i]+p]!=rank1[sa[i-1]+p]) ++k;
                rank[sa[i]]=k;
            }
        }k=0;
        for(int i=1;i<=n;++i){
            if(rank[i]==1){h[1]=0;continue;}
            if(i==1||h[rank[i-1]]<=1) k=0;
            if(k) --k;
            while(a[i+k]==a[sa[rank[i]-1]+k]) ++k;
            h[rank[i]]=k;       
        }
        for(int i=1;i<=n;++i) st[i][0]=h[i];
        for(int i=1;i<=Log[n];++i)
            for(int j=1;j<=n;++j)
                if(j+(1<<i-1)<=n) st[j][i]=min(st[j][i-1],st[j+(1<<i-1)][i-1]);
    }
    int lcp(int x,int y){
        int l=rank[x],r=rank[y];
        if(l>r) std::swap(l,r);l++;
        int t=Log[r-l+1];
        return min(st[l][t],st[r-(1<<t)+1][t]);
    }
}A,B;
void solve(int len){
    for(int i=1;i+len+k<=n;i+=len){
        int j=i+len+k;
        int r=A.lcp(i,j),l=B.lcp(n+1-i+1,n+1-j+1);
        if(r>len) r=len;if(l>len-1) l=len-1;
        if(l+r>=len) ans+=l+r-len+1;
    }
}
int main(){
//  freopen("a.in","r",stdin);
    scanf("%d%s",&k,s+1);
    n=strlen(s+1);Log[0]=-1;
    for(int i=1;i<=n;++i) Log[i]=Log[i>>1]+1;
    for(int i=1;i<=n;++i) A.a[i]=s[i],B.a[i]=s[n-i+1];
    A.init();B.init();
    for(int i=1;i+i+k<=n;++i) solve(i);
    printf("%lld\n",ans);
    return 0;
}