Luogu4770 NOI2018你的名字（后缀数组+线段树）

#include<iostream> 
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
#define ll long long
#define N 1600010
char getc(){char c=getchar();while ((c<‘A‘||c>‘Z‘)&&(c<‘a‘||c>‘z‘)&&(c<‘0‘||c>‘9‘)) c=getchar();return c;}
int gcd(int n,int m){return m==0?n:gcd(m,n%m);}
int read()
{
    int x=0,f=1;char c=getchar();
    while (c<‘0‘||c>‘9‘) {if (c==‘-‘) f=-1;c=getchar();}
    while (c>=‘0‘&&c<=‘9‘) x=(x<<1)+(x<<3)+(c^48),c=getchar();
    return x*f;
}
char s[N];
int len,n,m,a[N],sa[N],sa2[N],rk[N<<1],tmp[N<<1],cnt[N],h[N],f[22][N],lg2[N],lcp[N],id[N];
ll ans[N];
struct data
{
    int s,t,l,r,i;
    bool operator <(const data&a) const
    {
        return l>a.l;
    }
}q[N];
struct data2{int l,r,x;
}tree[N<<2];
void make(int m)
{
    for (int i=1;i<=n;i++) cnt[rk[i]=a[i]]++;
    for (int i=1;i<=m;i++) cnt[i]+=cnt[i-1];
    for (int i=n;i>=1;i--) sa[cnt[rk[i]]--]=i;
    for (int k=1;k<=n;k<<=1)
    {
        int p=0;
        for (int i=n-k+1;i<=n;i++) sa2[++p]=i;
        for (int i=1;i<=n;i++) if (sa[i]>k) sa2[++p]=sa[i]-k;
        memset(cnt,0,m+1<<2);
        for (int i=1;i<=n;i++) cnt[rk[i]]++;
        for (int i=1;i<=m;i++) cnt[i]+=cnt[i-1];
        for (int i=n;i>=1;i--) sa[cnt[rk[sa2[i]]]--]=sa2[i];
        memcpy(tmp,rk,sizeof(tmp));
        p=1;rk[sa[1]]=1;
        for (int i=2;i<=n;i++)
        {
            if (tmp[sa[i-1]]!=tmp[sa[i]]||tmp[sa[i-1]+k]!=tmp[sa[i]+k]) p++;
            rk[sa[i]]=p;
        }
        m=p;if (m==n) break;
    }
    for (int i=1;i<=n;i++)
    {
        h[i]=max(h[i-1]-1,0);
        while (a[i+h[i]]==a[sa[rk[i]-1]+h[i]]) h[i]++;
    }
    for (int i=1;i<=n;i++) f[0][i]=h[sa[i]];
    for (int i=2;i<=n;i++)
    {
        lg2[i]=lg2[i-1];
        if ((2<<lg2[i])<=i) lg2[i]++;
    }
    for (int j=1;j<22;j++)
        for (int i=1;i<=n;i++)
        f[j][i]=min(f[j-1][i],f[j-1][min(n,i+(1<<j-1))]);
}
int query(int x,int y)
{
    if (x==y) return N;x++;
    return min(f[lg2[y-x+1]][x],f[lg2[y-x+1]][y-(1<<lg2[y-x+1])+1]);
}
void build(int k,int l,int r)
{
    tree[k].l=l,tree[k].r=r;tree[k].x=N;
    if (l==r) {id[l]=k;return;}
    int mid=l+r>>1;
    build(k<<1,l,mid);
    build(k<<1|1,mid+1,r);
}
int findl(int x,int r)
{
    int ans=0,k=id[x],c=tree[k].x;
    while (k!=1)
    if (!(k&1)) k>>=1;
    else if (r-min(c,tree[k-1].x)+1>=query(tree[k-1].l,x)) {k>>=1;break;}
    else c=min(c,tree[k-1].x),k>>=1,ans=max(ans,min(query(tree[k].l,x),r-c+1));
    while (tree[k].l<tree[k].r&&tree[k].r>=x) k<<=1;
    while (tree[k].l<tree[k].r)
    if (r-min(c,tree[k<<1|1].x)+1>=query(tree[k<<1|1].l,x)) k=k<<1|1;
    else k<<=1,c=min(c,tree[k+1].x),ans=max(ans,min(query(tree[k+1].l,x),r-c+1));
    ans=max(ans,min(query(tree[k].l,x),r-min(tree[k].x,c)+1));
    return ans;
}
int findr(int x,int r)
{
    int ans=0,k=id[x],c=tree[k].x;
    while (k!=1)
    if (k&1) k>>=1;
    else if (r-min(c,tree[k+1].x)+1>=query(x,tree[k+1].r)) {k>>=1;break;}
    else c=min(c,tree[k+1].x),k>>=1,ans=max(ans,min(query(x,tree[k].r),r-c+1));
    while (tree[k].l<tree[k].r&&tree[k].l<=x) k=k<<1|1;
    while (tree[k].l<tree[k].r)
    if (r-min(c,tree[k<<1].x)+1>=query(x,tree[k<<1].r)) k<<=1;
    else k=k<<1|1,c=min(c,tree[k-1].x),ans=max(ans,min(query(x,tree[k-1].r),r-c+1));
    ans=max(ans,min(query(x,tree[k].r),r-min(tree[k].x,c)+1));
    return ans;
}
bool cmp(const int&a,const int&b)
{
    return rk[a]<rk[b];
}
int main()
{
#ifndef ONLINE_JUDGE
    freopen("name.in","r",stdin);
    freopen("name.out","w",stdout);
    const char LL[]="%I64d\n";
#else
    const char LL[]="%lld\n";
#endif
    scanf("%s",s+1);len=n=strlen(s+1);
    for (int i=1;i<=n;i++) a[i]=s[i]-‘a‘+1;
    a[++n]=27;
    m=read();
    for (int i=1;i<=m;i++)
    {
        scanf("%s",s+1);int t=strlen(s+1);
        q[i].s=n+1;
        for (int j=1;j<=t;j++) a[++n]=s[j]-‘a‘+1;
        q[i].t=n;a[++n]=28;
        q[i].l=read(),q[i].r=read(),q[i].i=i;
    }
    sort(q+1,q+m+1);
    make(28);
    build(1,1,n);
    q[0].l=len+1;
    for (int i=1;i<=m;i++)
    {
        for (int j=q[i-1].l-1;j>=q[i].l;j--)
            for (int k=id[rk[j]];k;k>>=1) tree[k].x=j;
        for (int j=q[i].s;j<=q[i].t;j++) tmp[j]=j;
        sort(tmp+q[i].s,tmp+q[i].t+1,cmp);
        for (int j=q[i].s;j<=q[i].t;j++) lcp[j]=max(findl(rk[tmp[j]],q[i].r),findr(rk[tmp[j]],q[i].r));
        ans[q[i].i]=q[i].t-tmp[q[i].s]+1-lcp[q[i].s];
        for (int j=q[i].s+1;j<=q[i].t;j++)
        ans[q[i].i]+=q[i].t-tmp[j]+1-max(lcp[j],query(min(rk[tmp[j]],rk[tmp[j-1]]),max(rk[tmp[j]],rk[tmp[j-1]])));
    }
    for (int i=1;i<=m;i++) printf(LL,ans[i]);
    return 0;
}