题目描述
题解
题目实际上是要求最长公共前缀和后缀的长度的平方和。个人认为题目描述中a和b应该取min
把这个串正反都求一下sa和height
由于是本质不同的子串,所以每一个后缀的贡献应该是当前串刨去它和前一个的lcp的剩下的前缀
可以求出贡献的前缀和,显然满足单调性
对于每组询问,二分找出这两个子串在rank里的位置,然后用rmq求区间最小值
再找出这两个子串的结尾的位置,在反串那边求最小值即可
代码
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
#define LL long long
#define N 200005
#define sz 17
int n,m,q;
char S[N],s[N];
int *x,*y,X[N],Y[N],c[N],sa[N],height[N],rank[N];
int st[N][sz+5],lg[N];
int l,r;
LL u,v,sum[N],a,b,ans;
void build_sa()
{
m=200;
x=X,y=Y;
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];
swap(x,y);
p=1,x[sa[0]]=0;
for (int i=1;i<n;++i)
x[sa[i]]=y[sa[i-1]]==y[sa[i]]&&(sa[i-1]+k<n?y[sa[i-1]+k]:-1)==(sa[i]+k<n?y[sa[i]+k]:-1)?p-1:p++;
if (p>n) break;
m=p;
}
}
void build_height()
{
for (int i=0;i<n;++i) rank[sa[i]]=i;
int k=0;height[0]=0;
for (int i=0;i<n;++i)
{
if (!rank[i]) continue;
if (k) --k;
int j=sa[rank[i]-1];
while (i+k<n&&j+k<n&&s[i+k]==s[j+k]) ++k;
height[rank[i]]=k;
}
}
void rmq()
{
for (int i=1,p=0;i<=n;++i)
{
while ((1<<p)<=i) ++p;
lg[i]=p-1;
}
for (int i=1;i<=n;++i) st[i][0]=height[i-1];
for (int j=1;j<sz;++j)
for (int i=1;i<=n;++i)
if (i+(1<<j)-1<=n)
st[i][j]=min(st[i][j-1],st[i+(1<<(j-1))][j-1]);
}
int query(int l,int r)
{
if (l>r) swap(l,r);
l+=2,r+=1;
if (l>r) return n+1;
int k=lg[r-l+1];
return min(st[l][k],st[r-(1<<k)+1][k]);
}
namespace e
{
int m;
char s[N];
int *x,*y,X[N],Y[N],sa[N],height[N],rank[N];
int st[N][sz+5],lg[N];
void clear()
{
for (int i=0;i<n;++i)
s[i]=S[n-i-1];
}
void build_sa()
{
m=200;
x=X,y=Y;
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];
swap(x,y);
p=1,x[sa[0]]=0;
for (int i=1;i<n;++i)
x[sa[i]]=y[sa[i-1]]==y[sa[i]]&&(sa[i-1]+k<n?y[sa[i-1]+k]:-1)==(sa[i]+k<n?y[sa[i]+k]:-1)?p-1:p++;
if (p>n) break;
m=p;
}
}
void build_height()
{
for (int i=0;i<n;++i) rank[sa[i]]=i;
int k=0;height[0]=0;
for (int i=0;i<n;++i)
{
if (!rank[i]) continue;
if (k) --k;
int j=sa[rank[i]-1];
while (i+k<n&&j+k<n&&s[i+k]==s[j+k]) ++k;
height[rank[i]]=k;
}
}
void rmq()
{
for (int i=1,p=0;i<=n;++i)
{
while ((1<<p)<=i) ++p;
lg[i]=p-1;
}
for (int i=1;i<=n;++i) st[i][0]=height[i-1];
for (int j=1;j<sz;++j)
for (int i=1;i<=n;++i)
if (i+(1<<j)-1<=n)
st[i][j]=min(st[i][j-1],st[i+(1<<(j-1))][j-1]);
}
int query(int l,int r)
{
if (l>r) swap(l,r);
l+=2,r+=1;
if (l>r) return n+1;
int k=lg[r-l+1];
return min(st[l][k],st[r-(1<<k)+1][k]);
}
}
int find(LL x)
{
int l=0,r=n-1,mid,ans=-1;
while (l<=r)
{
mid=(l+r)>>1;
if (sum[mid]>=x) ans=mid,r=mid-1;
else l=mid+1;
}
return ans;
}
int main()
{
scanf("%d%d",&n,&q);
scanf("%s",S);
for (int i=0;i<n;++i) s[i]=S[i];
build_sa();
build_height();
rmq();
e::clear();
e::build_sa();
e::build_height();
e::rmq();
sum[0]=(LL)n-(LL)sa[0];
for (int i=1;i<n;++i)
{
int now=max(0,n-sa[i]-height[i]);
sum[i]=sum[i-1]+(LL)now;
}
for (int i=1;i<=q;++i)
{
scanf("%lld%lld",&u,&v);
if (u>sum[n-1]||v>sum[n-1]){puts("-1");continue;}
l=find(u),r=find(v);
LL len=min((LL)n-1LL-(sum[l]-u)-(LL)sa[l]+1LL,(LL)n-1LL-(sum[r]-v)-(LL)sa[r]+1LL);
a=min((LL)query(l,r),len);a*=a;
u=(LL)n-1-(sum[l]-u),v=(LL)n-1-(sum[r]-v);
b=min((LL)e::query(e::rank[(LL)n-1LL-u],e::rank[(LL)n-1LL-v]),len);b*=b;
ans=a+b;
printf("%lld\n",ans);
}
}