HDU 4080 字符串哈希+二分

题意：

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4080
找到一个字符串中出现超过m次的最长的子串，以及该子串最有出现的起点。如果有多个相同的就选择最右端出现的。

---

思路：

二分长度，然后哈希统计子串出现次数。

---

代码：

#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ULL;
const ULL seed = 229;
const int MAXN = 4e4 + 10;

char s[MAXN];
ULL sum[MAXN], f[MAXN];
map <ULL, int> mp;
map <ULL, int> :: iterator it;
int ans, m, n, pos, anspos;

void init() {
    f[0] = 1;
    for (int i = 1; i <= 40000; i++)
        f[i] = f[i - 1] * seed;
}

bool check(int xx) {
    mp.clear();
    ULL tmp = 0;
    for (int i = 1; i <= xx; i++)
        tmp = tmp * seed + s[i] - 'a';
    mp[tmp]++;
    bool flag = (mp[tmp] >= m);
    if (flag) pos = 0;
    for (int i = 2; i + xx - 1 <= n; i++) {
        int j = i + xx - 1;
        tmp = (tmp - (s[i - 1] - 'a') * f[xx - 1]) * seed + s[j] - 'a';
        mp[tmp]++;
        if (mp[tmp] >= m) {
            flag = true;
            pos = i - 1;
        }
    }
    return flag;
}

void solve(int l, int r) {
    ans = -1;
    while (l <= r) {
        int mid = (l + r) >> 1;
        if (check(mid)) {
            ans = mid;
            anspos = pos;
            l = mid + 1;
        }
        else r = mid - 1;
    }
    if (ans == -1) puts("none");
    else printf("%d %d\n", ans, anspos);
}

int main() {
    //freopen("in.txt", "r", stdin);
    init();
    while (scanf("%d", &m), m) {
        scanf("%s", s + 1);
        n = strlen(s + 1);
        solve(1, n);
    }
    return 0;
}