[后缀数组 主席树] BZOJ 4556 [Tjoi2016&Heoi2016]字符串

二分答案 t，在后缀数组上找到与 [c,d] LCP 大于等于 t 的区间
[l,r]。
相当于询问 [l,r] 中是否存在 [a,b − t + 1] 里的数字 主席树

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
inline void read(char *s){
  char c=nc(); int len=0;
  for (;!(c>='a' && c<='z');c=nc());
  for (;c>='a' && c<='z';s[++len]=c,c=nc()); 
}

const int N=100005;
const int K=21;

int n; char s[N];

int ncnt,rt[N];
int sum[N*K],ls[N*K],rs[N*K];
inline void add(int &x,int y,int l,int r,int t){
  x=++ncnt; sum[x]=sum[y]+1;
  if (l==r) return;
  int mid=(l+r)>>1;
  if (t<=mid)
    add(ls[x],ls[y],l,mid,t),rs[x]=rs[y];
  else
    add(rs[x],rs[y],mid+1,r,t),ls[x]=ls[y];
}
inline int query(int x,int l,int r,int ql,int qr){
  if (!x) return 0;
  if (ql<=l && r<=qr) return sum[x];
  int ret=0,mid=(l+r)>>1;
  if (ql<=mid) ret+=query(ls[x],l,mid,ql,qr);
  if (qr>mid) ret+=query(rs[x],mid+1,r,ql,qr);
  return ret;
}
inline int Query(int l,int r,int a,int b){
  return query(rt[r],1,n,a,b)-query(rt[l-1],1,n,a,b);
}

namespace ST{
  int st[N][K],Log[N];
  inline void Pre(int *a,int n){
    for (int i=2;i<=n;i++) Log[i]=Log[i>>1]+1;
    for (int i=1;i<=n;i++) st[i][0]=a[i];
    for (int k=1;k<K;k++)
      for (int i=1;i<=n;i++){
    st[i][k]=st[i][k-1];
    if (i+(1<<(k-1))<=n)
      st[i][k]=min(st[i][k-1],st[i+(1<<(k-1))][k-1]);
      }
  }
  inline int Query(int l,int r){
    int t=Log[r-l+1];
    return min(st[l][t],st[r-(1<<t)+1][t]);
  }
}

int t1[N],t2[N],sa[N],rank[N],h[N],_c[N];

inline void SA(char *s,int m){
  int *x=t1,*y=t2;
  for (int i=1;i<=m;i++) _c[i]=0;
  for (int i=1;i<=n;i++) _c[x[i]=s[i]-'a'+1]++;
  for (int i=1;i<=n;i++) _c[i]+=_c[i-1];
  for (int i=n;i;i--) sa[_c[x[i]]--]=i;
  for (int k=1;k<=n;k<<=1){
    int p=0;
    for (int i=n-k+1;i<=n;i++) y[++p]=i;
    for (int i=1;i<=n;i++) if (sa[i]>k) y[++p]=sa[i]-k;
    for (int i=1;i<=m;i++) _c[i]=0;
    for (int i=1;i<=n;i++) _c[x[y[i]]]++;
    for (int i=1;i<=m;i++) _c[i]+=_c[i-1];
    for (int i=n;i;i--) sa[_c[x[y[i]]]--]=y[i];
    swap(x,y);
    x[sa[1]]=p=1;
    for (int i=2;i<=n;i++)
      x[sa[i]]=(y[sa[i]]==y[sa[i-1]] && y[sa[i]+k]==y[sa[i-1]+k])?p:++p;
    if (p>=n) break;
    m=p;
  }
}

inline void H(){
  for (int i=1;i<=n;i++) rank[sa[i]]=i;
  for (int i=1,j,k=0;i<=n;h[rank[i++]]=k)
    for (k?k--:0,j=sa[rank[i]-1];s[i+k]==s[j+k];)
      k++;
}

inline int LCP(int x,int y){
  if (x==y) return n-sa[x]+1;
  if (x>y) swap(x,y);
  return ST::Query(x+1,y);
}

int a,b,c,d;

inline bool check(int mid){
  int l,r,L,R,MID;
  L=rank[c],R=n+1;
  while (L+1<R)
    if (LCP(rank[c],MID=(L+R)>>1)>=mid)
      L=MID;
    else
      R=MID;
  r=L;
  L=0,R=rank[c];
  while (L+1<R)
    if (LCP(rank[c],MID=(L+R)>>1)<mid)
      L=MID;
    else
      R=MID;
  l=R;
  return Query(l,r,a,b-mid+1);
}

int main(){
  int Q;
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(n); read(Q); read(s);
  SA(s,26); H(); ST::Pre(h,n);
  for (int i=1;i<=n;i++) add(rt[i],rt[i-1],1,n,sa[i]);
  while (Q--){
    read(a); read(b); read(c); read(d);
    int L=0,R=min(b-a+1,d-c+1)+1,MID;
    while (L+1<R)
      if (check(MID=(L+R)>>1))
    L=MID;
      else
    R=MID;
    printf("%d\n",L);
  }
  return 0;
}