传送门
s
t
O
stO
stO 神题
O
r
z
Orz
Orz
题意:
给定一个串S,有Q个询问,每次问一个区间内字典序最大的子串。
|S|,Q<=10^5,可以离线!
大佬的题解:
代码:
#include<bits/stdc++.h>
#define ri register int
#define fi first
#define se second
using namespace std;
const int rlen=1<<18|1;
inline char gc(){
static char buf[rlen],*ib,*ob;
(ib==ob)&&(ob=(ib=buf)+fread(buf,1,rlen,stdin));
return ib==ob?-1:*ib++;
}
inline int read(){
int ans=0;
char ch=gc();
while(!isdigit(ch))ch=gc();
while(isdigit(ch))ans=((ans<<2)+ans<<1)+(ch^48),ch=gc();
return ans;
}
const int N=1e5+5;
char s[N];
int n,ans[N],m;
namespace SA{
int Lg[N],st[N][18],sa[N],ht[N],rk[N],sa2[N],nm;
inline void Sort(){
static int cnt[N];
for(ri i=1;i<=nm;++i)cnt[i]=0;
for(ri i=1;i<=n;++i)++cnt[rk[i]];
for(ri i=1;i<=nm;++i)cnt[i]+=cnt[i-1];
for(ri i=n;i;--i)sa[cnt[rk[sa2[i]]]--]=sa2[i];
}
inline void getsa(){
for(ri i=1;i<=n;++i)rk[i]=s[i],sa2[i]=i;
nm=150;
Sort();
for(ri p=0,w=1;n^nm;nm=p,p=0,w<<=1){
for(ri i=n-w+1;i<=n;++i)sa2[++p]=i;
for(ri i=1;i<=n;++i)if(sa[i]>w)sa2[++p]=sa[i]-w;
Sort(),swap(rk,sa2);
rk[sa[p=1]]=1;
for(ri i=2;i<=n;++i)rk[sa[i]]=(sa2[sa[i]]==sa2[sa[i-1]]&&sa2[sa[i]+w]==sa2[sa[i-1]+w])?p:++p;
}
for(ri i=1,j,k=0;i<=n;ht[rk[i++]]=k)for(j=sa[rk[i]-1],k?--k:0;s[i+k]==s[j+k];++k);
for(ri i=2;i<=n;++i)Lg[i]=Lg[i>>1]+1;
for(ri i=1;i<=n;++i)st[i][0]=ht[i];
for(ri j=1;j<18;++j)for(ri i=1;i+(1<<j)-1<=n;++i)st[i][j]=min(st[i][j-1],st[i+(1<<(j-1))][j-1]);
}
inline int query(int l,int r){
if(l==r)return n-l+1;
l=rk[l],r=rk[r];
if(l>r)swap(l,r);
++l;
int k=Lg[r-l+1];
return min(st[l][k],st[r-(1<<k)+1][k]);
}
}
set<int>S;
typedef pair<int,int> pii;
vector<pii>qry[N];
int stk[N],top=0;
vector<int>f[N],g[N];
inline void delet(int p){
for(ri i=0;i<f[p].size();++i)S.erase(f[p][i]);
S.erase(p);
}
int main(){
scanf("%s",s+1);
n=strlen(s+1);
SA::getsa();
m=read();
for(ri i=1,l,r;i<=m;++i)l=read(),r=read(),qry[r].push_back(pii(l,i));
for(ri i=1;i<=n;++i){
while(top&&SA::rk[stk[top]]<SA::rk[i]){
int d=SA::query(stk[top],i);
if(!d){
delet(stk[top--]);
continue;
}
g[i+d].push_back(stk[top]);
f[i].push_back(stk[top]);
--top;
}
stk[++top]=i;
S.insert(i);
for(ri j=0;j<g[i].size();++j)delet(g[i][j]);
for(ri j=0;j<qry[i].size();++j)ans[qry[i][j].se]=*S.lower_bound(qry[i][j].fi);
}
for(ri i=1;i<=m;++i)cout<<ans[i]<<'\n';
return 0;
}