题目链接:https://nanti.jisuanke.com/t/A2018
题意:给你一个字符串,设其子串的出现次数位x ,问 A <= x <= B 的子串数目
后缀数组求出现的次数大于k的子串的数目,然后用sum[L] - sum[R + 1]即可
当然这也是后缀自动机的裸体;
#include<bits/stdc++.h>
#define lson rt<<1
#define rson rt<<1|1
#define rank ra
using namespace std;
const int maxn=1e5+10;
const int INF=1e9+7;
typedef long long ll;
char s[maxn];
int L,R,n;
int sa[maxn],rank[maxn],height[maxn];
int t1[maxn],t2[maxn],r[maxn],c[maxn];
bool cmp(int *r,int a,int b,int l)
{
return r[a]==r[b] && r[a+l]==r[b+l];
}
void da(int str[],int sa[],int rank[],int height[],int n,int m)
{
n++;
int i,j,p,*x=t1,*y=t2;
for(int i=0;i<m;i++) c[i]=0;
for(int i=0;i<n;i++) c[x[i]=str[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 j=1;j<=n;j<<=1)
{
p=0;
for(int i=n-j;i<n;i++) y[p++]=i;
for(int i=0;i<n;i++) if(sa[i]>=j) y[p++]=sa[i]-j;
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];
swap(x,y);
p=1,x[sa[0]]=0;
for(int i=1;i<n;i++)
x[sa[i]]=cmp(y,sa[i-1],sa[i],j)?p-1:p++;
if(p>=n) break;
m=p;
}
int k=0;
n--;
for(int i=0;i<=n;i++) rank[sa[i]]=i;
for(int i=0;i<n;i++)
{
if(k) k--;
j=sa[rank[i]-1];
while(str[i+k]==str[j+k]) k++;
height[rank[i]]=k;
}
}
struct node
{
ll val;
int l,r,mid;
}t[maxn<<2];
void build(int l,int r,int rt)
{
int mid=(l+r)>>1;
t[rt].l=l,t[rt].r=r,t[rt].mid=mid;
t[rt].val=INF;
if(l==r)
{
t[rt].val=height[l];
return ;
}
if(l<=t[rt].mid) build(l,mid,lson);
if(r>t[rt].mid) build(mid+1,r,rson);
t[rt].val=min(t[lson].val,t[rson].val);
}
int query(int l,int r,int rt)
{
int res=INF;
if(l<=t[rt].l&&t[rt].r<=r)
return t[rt].val;
if(l<=t[rt].mid) res=min(res,query(l,r,lson));
if(r>t[rt].mid) res=min(res,query(l,r,rson));
return res;
}
ll cal(int k) //求出现k次以上的字符串的个数
{
ll ans=0;
if(k==1){
for(int i=1;i<=n;i++) ans+=(n-sa[i]-height[i]);
return ans;
}
int l=2,r=2+k-2;
int pre=0;
while(r<=n){
int now=query(l,r,1);
if(now>=pre) ans+=now-pre;
pre=now;
l++,r++;
}
return ans;
}
int main(){
while(scanf("%s",s)!=EOF){
scanf("%d%d",&L,&R);
int ls=strlen(s);
for(int i=0;i<ls;i++) r[i]=s[i]-'A'+1;
r[ls]=0,n=ls;
da(r,sa,rank,height,n,30);
build(2,n,1);
printf("%lld\n",cal(L)-cal(R+1));
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
typedef long long ll;
char s[maxn];
struct Sam {
int next[maxn << 1][26];
int link[maxn << 1], step[maxn << 1];
ll endpos[maxn << 1];
int a[maxn], b[maxn << 1];
int sz, last, len;
void init() {
memset(next, 0, sizeof(next));
memset(endpos, 0, sizeof(endpos));
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
sz = last = 1;
}
void add(int c) {
int p = last;
int np = ++sz;
last = np;
endpos[np] = 1;
step[np] = step[p] + 1;
while(!next[p][c] && p) {
next[p][c] = np;
p = link[p];
}
if(p == 0) {
link[np] = 1;
} else {
int q = next[p][c];
if(step[p] + 1 == step[q]) {
link[np] = q;
} else {
int clone = ++sz;
memcpy(next[clone], next[q], sizeof(next[q]));
step[clone] = step[p] + 1;
link[clone] = link[q];
link[q] = link[np] = clone;
while(next[p][c] == q && p) {
next[p][c] = clone;
p = link[p];
}
}
}
}
void build() {
init();
for(int i = 0; i < len; i++) add(s[i] - 'A');
for(int i = 1; i <= sz; i++) a[step[i]]++;
for(int i = 1; i <= len; i++) a[i] += a[i - 1];
for(int i = 1; i <= sz; i++) b[a[step[i]]--] = i;
for(int i = sz; i > 1; i--) {
int e = b[i];
endpos[link[e]] += endpos[e];
}
}
void solve() {
int A, B;
scanf("%d%d", &A, &B);
len = strlen(s);
build();
ll ans = 0;
for(int i = 1; i <= sz; i++) {
if(endpos[i] >= A && endpos[i] <= B) {
ans += step[i] - step[link[i]];
}
}
printf("%lld\n", ans);
}
} sam;
int main() {
while(~scanf("%s", s)) {
sam.solve();
}
return 0;
}