#include<set>
#include<ctime>
#include<queue>
#include<cstdio>
#include<bitset>
#include<cctype>
#include<bitset>
#include<cstdlib>
#include<cassert>
#include<cstring>
#include<iostream>
#include<algorithm>
#define inf (1<<30)
#define INF (1ll<<62)
#define fi first
#define se second
#define rep(x,s,t) for(register int x=s,t_=t;x<t_;++x)
#define per(x,s,t) for(register int x=t-1,s_=s;x>=s_;--x)
#define prt(x) cout<<#x<<":"<<x<<" "
#define prtn(x) cout<<#x<<":"<<x<<endl
#define pb(x) push_back(x)
#define hash asfmaljkg
#define rank asfjhgskjf
#define y1 asggnja
#define y2 slfvm
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
template<class T>void sc(T &x){
int f=1;char c;x=0;
while(c=getchar(),c<48)if(c=='-')f=-1;
do x=x*10+(c^48);
while(c=getchar(),c>47);
x*=f;
}
template<class T>void nt(T x){
if(!x)return;
nt(x/10);
putchar(x%10+'0');
}
template<class T>void pt(T x){
if(x<0)putchar('-'),x=-x;
if(!x)putchar('0');
else nt(x);
}
template<class T>void ptn(T x){
pt(x);putchar('\n');
}
template<class T>void pts(T x){
pt(x);putchar(' ');
}
template<class T>inline void Max(T &x,T y){if(x<y)x=y;}
template<class T>inline void Min(T &x,T y){if(x>y)x=y;}
int n;
const int maxn=1000006;
const int maxc=30;
int stp[maxn];
char s[maxn];
struct Suffix{
int n;
int sa[maxn],rk[maxn];//adc.
int h[maxn];
int mn[20][maxn];
ll sm[maxn];//sup.
int v[maxn];//sort.
void sapoly(){
int *a=rk,*b=h;
rep(i,1,maxc)v[i]=0;
rep(i,1,n+1)v[s[i]]++;
rep(i,1,maxc)v[i]+=v[i-1];
rep(i,1,n+1)sa[v[s[i]]--]=i;
rep(i,1,n+1)a[sa[i]]=a[sa[i-1]]+(s[sa[i-1]]!=s[sa[i]]);
a[n+1]=b[n+1]=0;
for(int p,k=1;k<n;k<<=1){
p=0;
rep(i,1,n+1)v[a[sa[i]]]=i;
rep(i,n-k+1,n+1)b[++p]=i;
rep(i,1,n+1)if(sa[i]>k)b[++p]=sa[i]-k;
per(i,1,n+1)sa[v[a[b[i]]]--]=b[i];
p=0;
rep(i,1,n+1)b[sa[i]]=(a[sa[i-1]]!=a[sa[i]]||a[sa[i-1]+k]!=a[sa[i]+k])?++p:p;
swap(a,b);
if(p==n)break;
}
if(a!=rk)memcpy(rk,a,n+1<<2);
}
void hipoly(){
int k=0;
rep(i,1,n+1){
for(int j=sa[rk[i]-1];s[j+k]==s[i+k];++k);
h[rk[i]]=k;if(k)--k;
}
rep(i,1,n+1)mn[0][i]=h[i];
rep(i,1,stp[n]+1)
rep(j,1,n-(1<<i)+2)
mn[i][j]=min(mn[i-1][j],mn[i-1][j+(1<<i-1)]);
}
int lcp(int x,int y){
// x=rk[x];y=rk[y];
if(x>y)swap(x,y);++x;
int k=stp[y-x+1];
return min(mn[k][x],mn[k][y-(1<<k)+1]);
}
void sumpoly(){
rep(i,1,n+1)sm[i]=sm[i-1]+(n-sa[i]+1-h[i]);
}
void init(char *str,int nn){
n=nn;
rep(i,1,n+1)s[i]=s[i]-'a'+1;
sapoly();
hipoly();
sumpoly();
}
void print(){
rep(i,1,n)pts(sa[i]);ptn(sa[n]);
rep(i,2,n)pts(h[i]);if(n>1)ptn(h[n]);
}
}sax;
char ch[10];
struct Chairman{
struct node{
int sz,ls,rs;
node(){
sz=ls=rs=0;
}
}v[maxn*24];
int top,T[maxn],tot;
void update(int p,int &q,int l,int r,int x){
q=++top;
v[q]=v[p];
v[q].sz++;
if(l==r)return;
int mid=l+r>>1;
if(x<=mid)update(v[p].ls,v[q].ls,l,mid,x);
else update(v[p].rs,v[q].rs,mid+1,r,x);
}
void build(){
rep(i,1,n+1)update(T[i-1],T[i],1,tot,sax.sa[i]);
}
void print(int x,int l,int r){
prt(x);prt(l);prt(r);prtn(v[x].sz);
if(l==r)return;
int mid=l+r>>1;
print(v[x].ls,l,mid);
print(v[x].rs,mid+1,r);
}
int qrk(int p,int q,int l,int r,int x){
if(l==r)return 1;
int mid=l+r>>1;
if(x<=mid)return qrk(v[p].ls,v[q].ls,l,mid,x);
return v[v[q].ls].sz-v[v[p].ls].sz+qrk(v[p].rs,v[q].rs,mid+1,r,x);
}
int query_rk(int l,int r,int x){
return qrk(T[l-1],T[r],1,tot,x);
}
int qid(int p,int q,int l,int r,int k){
if(l==r)return l;
int t=v[v[q].ls].sz-v[v[p].ls].sz;
int mid=l+r>>1;
if(t<k)return qid(v[p].rs,v[q].rs,mid+1,r,k-t);
else return qid(v[p].ls,v[q].ls,l,mid,k);
}
int query_id(int l,int r,int k){
return qid(T[l-1],T[r],1,tot,k);
}
}chm;
void query1(ll k1,int k2){
int L=1,R=n,res;
while(L<=R){
int mid=L+R>>1;
if(sax.sm[mid]>=k1){
res=mid;
R=mid-1;
}
else L=mid+1;
}
int len=k1-sax.sm[res-1]+sax.h[res];
int lo=res+1,hi=n,rs=res;
while(lo<=hi){
int mid=lo+hi>>1;
if(sax.lcp(res,mid)>=len){
rs=mid;
lo=mid+1;
}
else hi=mid-1;
}
int l=chm.query_id(res,rs,k2);
pts(l);ptn(l+len-1);
}
void query2(int l,int r){
int p=sax.rk[l];
int len=r-l+1;
int L=1,R=p-1,res=p;
while(L<=R){
int mid=L+R>>1;
if(sax.lcp(mid,p)>=len){
res=mid;
R=mid-1;
}
else L=mid+1;
}
ll k1=sax.sm[res-1]+len-sax.h[res];
int lo=res+1,hi=n,rs=res;
while(lo<=hi){
int mid=lo+hi>>1;
if(sax.lcp(res,mid)>=len){
rs=mid;
lo=mid+1;
}
else hi=mid-1;
}
int k2=chm.query_rk(res,rs,l);
pts(k1);ptn(k2);
}
int main(){
// freopen("pro.in","r",stdin);
// freopen("chk.out","w",stdout);
stp[0]=-1;
rep(i,1,maxn)stp[i]=stp[i>>1]+1;
scanf("%s",s+1);
n=strlen(s+1);
sax.init(s,n);
chm.tot=n;
chm.build();
int Q;sc(Q);
ll u,v;
while(Q--){
scanf("%s",ch);
sc(u);sc(v);
if(ch[0]=='S')query1(u,v);
else query2(u,v);
}
return 0;
}
Origin Suffix Array && Chairman Tree
最新推荐文章于 2021-07-03 17:45:46 发布