建出后缀树,运用启发式合并set可以让我们知道一个点的right集合
考虑加入一个set的元素x所产生的贡献
很显然只跟当前set中x的前继和后继有关,因为这两个是最靠近的
于是我们的到
n
l
o
g
2
n
nlog_{2}n
nlog2n个点对
对于一个点对
(
x
,
y
)
(x,y)
(x,y),它会对
1
≤
i
≤
m
,
l
i
≤
x
≤
r
i
,
l
i
≤
y
≤
r
i
1\leq i\leq m,l_{i}\leq x \leq r_{i},l_{i}\leq y \leq r_{i}
1≤i≤m,li≤x≤ri,li≤y≤ri有贡献
运用树状数组去更新答案即可。
#include<iostream>
#include<cstring>
#include<cstdio>
#include<set>
#include<algorithm>
using namespace std;
int n,m;
#define Maxn 100010
#define V 4000010
char ch[Maxn];
struct Query{
int l,r,id;
bool operator <(const Query &z)const{return l>z.l;}
}Q[Maxn];
int Ans[Maxn];
set<int> s[Maxn<<1];
set<int>::iterator it,h;
struct Node{
int son[2],fa;
int len;
}tree[Maxn<<1];
int last=1,cnt=1;
struct P{
int x,y,val;
bool operator <(const P &z)const{return x>z.x;}
}ans[V];
int len=0;
int sa[Maxn<<1],ton[Maxn<<1];
inline void insert(char c){
int now=++cnt,k=last;
tree[now].len=tree[k].len+1;
int dir=c-'0';
while(k&&!tree[k].son[dir])tree[k].son[dir]=now,k=tree[k].fa;
if(!k)tree[now].fa=1;
else{
int q=tree[k].son[dir];
if(tree[q].len==tree[k].len+1)tree[now].fa=q;
else{
int nq=++cnt;
tree[nq]=tree[q];
tree[nq].len=tree[k].len+1;
tree[now].fa=tree[q].fa=nq;
while(k&&tree[k].son[dir]==q)tree[k].son[dir]=nq,k=tree[k].fa;
}
}
last=now;
}
inline void solve(){
for(int i=1;i<=cnt;++i)ton[tree[i].len]++;
for(int i=1;i<=cnt;++i)ton[i]+=ton[i-1];
for(int i=cnt;i>=1;--i)sa[ton[tree[i].len]--]=i;
for(int i=cnt;i>=2;--i){
int k=sa[i];
if(s[k].size()>s[tree[k].fa].size())swap(s[k],s[tree[k].fa]);
for(it=s[k].begin();it!=s[k].end();++it){
h=s[tree[k].fa].lower_bound(*it);
if(h!=s[tree[k].fa].end())ans[++len]=(P){*it,*h,tree[tree[k].fa].len};
if(h!=s[tree[k].fa].begin()){
h--;
ans[++len]=(P){*h,*it,tree[tree[k].fa].len};
}
}
for(it=s[k].begin();it!=s[k].end();++it)s[tree[k].fa].insert(*it);
}
}
int maxv[Maxn];
inline int lowbit(int x){return x&(-x);}
inline void Add(int x,int val){for(int i=x;i<=n;i+=lowbit(i))maxv[i]=max(maxv[i],val);}
inline int FetchAns(int x){
int answer=0;
for(int i=x;i;i-=lowbit(i))answer=max(answer,maxv[i]);
return answer;
}
inline void rd(int &x){
x=0;char ch=getchar();
while(ch<'0'||ch>'9')ch=getchar();
while(ch>='0'&&ch<='9'){
x=x*10+ch-'0';
ch=getchar();
}
}
int main(){
rd(n);rd(m);
scanf("%s",ch+1);
for(register int i=1;i<=n;++i){
insert(ch[i]);
s[last].insert(i);
}
solve();
for(register int i=1;i<=m;++i){
rd(Q[i].l);rd(Q[i].r);
Q[i].id=i;
}
sort(ans+1,ans+len+1);
sort(Q+1,Q+m+1);
int nxt=1;
for(register int i=1;i<=m;++i){
while(nxt<=len&&ans[nxt].x>=Q[i].l){
Add(ans[nxt].y,ans[nxt].val);
nxt++;
}
Ans[Q[i].id]=FetchAns(Q[i].r);
}
for(register int i=1;i<=m;++i)printf("%d\n",Ans[i]);
return 0;
}