给定文本串T,求在T中形如UVU的字串,其中两端相同字串,则成为L-gap串,L为中间V的长度。
求给定L的情况下,形如该字符串的总数,解题思想:
任意一个满足条件的UVU,假设U的长度是len,那么左端的U必然包含按照len切分的T串的某个字串,及0,len,2len,3len...。(这点要仔细想清楚)
那么枚举每个端点i*len,然后利用RMQ求后缀i*len和后缀i*len+L+len的LCP,然后字符串T反向,再求一遍反向的LCP2。(其中LCP要小于等于len,否则会重复,仔细想清楚)
最后累加求和sum+=(LCP+LCP2-1)-len+1。(这点想清楚为什么是-len)
#include <cstdio>
#include <fstream>
#include <cstring>
#include <algorithm>
using namespace std;
#define maxn 50000+100
int s[maxn], s2[maxn];
int sa[maxn], sa2[maxn];
int rank[maxn],height[maxn], rank2[maxn],height2[maxn];
int t[maxn],t2[maxn],c[maxn];
int d[maxn][100],d2[maxn][100];
int n;
void build_sa(int* s,int* 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=0;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;
}
}
void getheight(int *s,int* sa,int *rank,int *height)
{
int i,k= 0;
for (i=0;i<=n;i++) rank[sa[i]]=i;
for (i=0;i<n;i++) {
if (k) k--;
int j=sa[rank[i]-1];
while (s[i+k]==s[j+k]) k++;
height[rank[i]]=k;
}
}
void RMQ_init(int* count,int d[][100],int n)
{
for (int i=1;i<=n;i++) d[i][0]=count[i];
for (int j=1;(1<<j)<=n;j++)
for (int i=1;i+(1<<j)-1<=n;i++)
d[i][j]=min(d[i][j-1],d[i+(1<<(j-1))][j-1]);
}
int RMQ(int d[][100],int L,int R)
{
int k=0;
while ((1<<(k+1))<=R-L+1) k++;
return min(d[L][k],d[R-(1<<k)+1][k]);
}
int main()
{
freopen("1.in","r",stdin);
int T, g;
char st[maxn];
scanf("%d",&T);
for (int t=1;t<=T;t++) {
scanf("%d%s",&g,st);
for (n=0;st[n];n++) s[n]=st[n]-'a'+1;
s[n]=0;
build_sa(s,sa,n+1,27);
getheight(s,sa,rank,height);
for (int i=0;i<n;i++) s2[i]=s[n-i-1];
s2[n]=0;
build_sa(s2,sa2,n+1,27);
getheight(s2,sa2,rank2,height2);
RMQ_init(height,d,n);
RMQ_init(height2,d2,n);
int l, r, lcp, lcp2, sum=0;
for (int len=1;len<=n/2;len++)
for (int i=0;i+g+len<n;i+=len) {
l=rank[i];
r=rank[i+g+len];
if (l>r) swap(l,r);
lcp=min(len,RMQ(d,l+1,r));
l=rank2[n-1-i];
r=rank2[n-1-(i+g+len)];
if (l>r) swap(l,r);
lcp2=min(len,RMQ(d2,l+1,r));
if(lcp+lcp2>len) sum+=lcp+lcp2-len;
}
printf("Case %d: %d\n",t,sum);
}
return 0;
}