求字符串中满足UVU形式子串个数,其中V的长度固定为gap,U不能为空
首先枚举U的长度l,然后类似于poj3693那题的方法,将原串分为n/l组;
比如 bbaabaaaaa l = 2时,分成 bb | aa | ba | aa| aa
然后显然有个性质——左边的那个U必然要包含且只包含一个端点(其实右边也一样,但是我们只考虑左边来计数)
所以我们考虑每个端点i*l,以及右边i*l+gap+l位置往左和往右最长能匹配的长度LL(往右的用后缀数组求字符串height数组+RMQ,往左的求字符串反向的height数组+RMQ)
每次加上LL - l就得到最后的答案了,注意有可能匹配的长度LL会超过2*l,这时就会包含2个以上的端点,所以在求匹配长度时要加个限制,具体看代码。
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <ctime>
#include <numeric>
#include <vector>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <complex>
#include <deque>
#include <functional>
#include <list>
#include <map>
#include <string>
#include <sstream>
#include <set>
#include <stack>
#include <queue>
using namespace std;
template<class T> inline T sqr(T x) { return x * x; }
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<PII, int> PIII;
typedef pair<LL, LL> PLL;
typedef pair<LL, int> PLI;
typedef pair<LD, LD> PDD;
#define MP make_pair
#define PB push_back
#define sz(x) ((int)(x).size())
#define clr(ar,val) memset(ar, val, sizeof(ar))
#define istr stringstream
#define FOR(i,n) for(int i=0;i<(n);++i)
const double EPS = 1e-6;
const int INF = 0x3fffffff;
const LL LINF = INF * 1ll * INF;
const double PI = acos(-1.0);
using namespace std;
#define MAXN 50005
char s[MAXN],s2[MAXN];
int sa[MAXN],t1[MAXN],t2[MAXN],c[MAXN],rank[MAXN],height[MAXN];
int sa2[MAXN],rank2[MAXN],height2[MAXN];
int d1[16][MAXN],d2[16][MAXN];
void build_sa(int n,int *sa,char *s){
int *x = t1,*y = t2;
int m = 128;
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 k = 1;k<=n;k<<=1){
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>=0;i--) sa[--c[x[y[i]]]] = y[i];
int *tmp = x;x = y;y = tmp;
p = 1;x[sa[0]] = 0;
for(int i = 1;i<n;i++)
x[sa[i]] = y[sa[i]]==y[sa[i-1]]&&y[sa[i]+k]==y[sa[i-1]+k]?p-1:p++;
if(p>=n) break;
m = p;
}
}
void getHeight(int n,char *s,int *sa,int *rank,int *height){
int k = 0;
for(int i = 0;i<=n;i++) rank[sa[i]] = i;
for(int 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 init_RMQ(int d[][MAXN],int *height,int n){
for(int i = 0;i<=n;i++) d[0][i] = height[i];
for(int i = 1;(1<<i)<=n;i++){
for(int j = 1;j+(1<<i)-1<=n;j++){
d[i][j] = min(d[i-1][j],d[i-1][j+(1<<(i-1))]);
}
}
}
int RMQ(int d[][MAXN],int l,int r){
int k = 0;
while(1<<(1+k)<=r-l+1) k++;
return min(d[k][l],d[k][r-(1<<k)+1]);
}
int main(void){
#ifndef ONLINE_JUDGE
freopen("data.in","r",stdin);
#endif
int t,ca = 1;
scanf("%d",&t);
while(t--){
int g;
scanf("%d %s",&g,s);
int n = strlen(s);
build_sa(n+1,sa,s);
getHeight(n,s,sa,rank,height);
for(int i = n-1;i>=0;i--) s2[i] = s[n-1-i];
s2[n] = '\0';
build_sa(n+1,sa2,s2);
getHeight(n,s2,sa2,rank2,height2);
init_RMQ(d1,height,n);
init_RMQ(d2,height2,n);
int ans = 0;
for(int l = 1;l<=n/2;l++){
for(int i = 0;i+g+l<n;i+=l){
int posl = rank[i],posr = rank[i+g+l];
if(posl>posr) posl^=posr^=posl^=posr;
int left = min(l,RMQ(d1,posl+1,posr));
posl = rank2[n-1-i],posr = rank2[n-1-i-g-l];
if(posl>posr) posl^=posr^=posl^=posr;
int right = min(l,RMQ(d2,posl+1,posr));
int lcp = left+right;
if(lcp>l) ans+=lcp-l;
}
}
printf("Case %d: %d\n",ca++,ans);
}
}