1864: 字符串的后缀佐助题库http://12345code.com/status.php?user_id=yzc30&top=150644

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MXN = 1e5 + 5;
const int p = 13131;
const int mod = 1e9 + 7;

int n, has[MXN], pn[MXN];
char s[MXN];
int get_hash(int l, int r) {
    int ans = (has[r] - (long long)has[l-1]*pn[r-l+1]) % mod;

    return (ans + mod) % mod;
}
int main() {
    pn[0] = 1;
    for(int i = 1; i < MXN; ++i) pn[i] = (long long)pn[i-1] * p % mod;

    scanf("%s", s + 1);
    n = strlen(s + 1);
    for(int i = 1; i <= n; ++i) {
        has[i] = ((long long)has[i - 1] * p + s[i] - 'a' + 1) % mod;
    }
    long long ans = n;
    for(int i = 2; i <= n; ++i) {
        int L = 1, R = n - i + 1, mid, res = 0;
        while(L <= R) {
            mid = (L + R) >> 1;
            if(get_hash(1, mid) == get_hash(i, i + mid - 1)) {