后缀数组 Page69 哈希+二分

后缀数组 Page69 哈希+二分

将字典序排序转化为两者最大公共前缀部分的后一个字母的比较

代码：

#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<queue>
#include<map>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define rep(x,a,b) for (int x=a;x<=b;x++)
#define repp(x,a,b) for (int x=a;x<b;x++)
#define W(x) printf("%d\n",x)
#define WW(x) printf("%lld\n",x)
#define pi 3.14159265358979323846
#define mem(a,x) memset(a,x,sizeof a)
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;
const int maxn=2e6+7;
const int INF=1e9;
const ll INFF=1e18;
ull f[maxn],p[maxn];
char s[maxn];
int ans[maxn],length[maxn],pos[maxn],n;
ull Hash(int l,int r)//[l,r]
{
    return f[r]-f[l-1]*p[r-l+1];
}
int solve(int x,int y)
{
    int l=0,r=min(n-x+1,n-y+1);
    while(l<r)
    {
        int mid=(l+r+1)>>1;
        if (Hash(x,x+mid-1)==Hash(y,y+mid-1))l=mid;
        else r=mid-1;
    }
    return l;
}
bool cmp(int a,int b)
{
    int x=solve(a,b);
    return s[a+x]<s[b+x];
}
int main()
{
    scanf("%s",s+1);
    n=strlen(s+1);
    p[0]=1;
    rep(i,1,n)
    {
        f[i]=f[i-1]*131+s[i]-'a'+1;
        p[i]=p[i-1]*131;
        pos[i]=i;
    }
    sort(pos+1,pos+1+n,cmp);
    rep(i,1,n)printf("%d ",pos[i]-1);puts("");
    rep(i,1,n)printf("%d ",solve(pos[i-1],pos[i]));puts("");
}