LOJ#111. 后缀排序(二分 hash)

题意

给出一个字符串，求出排名为$i$个字符串在原串中的开始位置

Sol

纪念一下这伟大的时刻qwq。

我用二分+hash把这题水过去了qwq。

#include<cstdio>
#include<cstring>
#include<algorithm>
#define ull long long
const int MAXN = 1e6 + ;
ull h[MAXN], base[MAXN], seed = ;
int N, a[MAXN], sa[MAXN], tot;
char s[MAXN];
ull gethash(int l, int r) {return h[l] - h[r + ] * base[r - l + ];}
bool check(int a, int b, int mid) {
    if((a + mid -  > N) || (b + mid -  > N) || (a < ) || (b < )) return ;
    return gethash(a, a + mid - ) == gethash(b, b + mid - );
}
bool comp(int a, int b) {
    int l = , r = N, ans = ;
    while(l <= r) {
        int mid = l + r >> ;
        if(check(a, b, mid)) l = mid + , ans = mid;
        else r = mid - ;
    }
    return s[a + ans] < s[b + ans];
}
int main() {
    scanf("%s", s + );
    N = strlen(s + );
    for(int i = ; i <= N; i++) a[i] = i;
    base[] = ;
    for(int i = ; i <= N; i++) base[i] = base[i - ] * seed;
    for(int i = N; i >= ; i--) h[i] = h[i + ] * seed + s[i];
    std::sort(a + , a + N + , comp);
    for(int i = ; i <= N; i++) printf("%d ", a[i]);
    return ;
}