字符串哈希

圈圈

题目链接

#include <cstdio>
#include <vector>
using namespace std;
typedef unsigned long long ull;
const int maxn = 100005;
int n, m, k, a[maxn];
ull base = 100007, b[maxn], h[maxn];
vector<int> v[maxn];
int Solve(int s1, int s2, int add) {
    int l = 0, r = n, mid, ans = 0;
    while (l <= r) {//二分判断字符串是否相等
        mid = (l + r) / 2;
        if (h[s1] - h[s1 + mid] * b[mid] == h[s2] - h[s2 + mid] * b[mid])
            ans = mid, l = mid + 1;
        else
            r = mid - 1;
    }
    if (ans == n)//相等就随便返回s1或者s2
        return s1;
    //不相等就判断比较最前面的那一位不同的字符
    return (a[s1 + ans] + add) % m < (a[s2 + ans] + add) % m ? s1 : s2;
}
int main() {
    scanf("%d%d%d", &n, &m, &k);
    k--;
    for (int i = 0; i < n; i++) {
        scanf("%d", &a[i]);
        a[i + n] = a[i];
        //v数组记录要要取余的字符下标
        v[m - a[i]].push_back(i);
    }
    b[0] = 1;
    for (int i = 1; i <= 2 * n; i++)
        b[i] = b[i - 1] * base;
    for (int i = 2 * n - 1; i >= 0; i--)
        h[i] = h[i + 1] * base + a[i];
    int ans = 0;
    for (int i = 1; i < n; i++)
        ans = Solve(ans, i, 0);
    printf("%d\n", a[ans + k]);
    for (int i = 1; i < m; i++) {//i是表示轮到+1还是+2还是+3
        if (v[i].size()) {
            ans = v[i][0];
            for (int j = 1; j < v[i].size(); j++)
                ans = Solve(ans, v[i][j], i);
        }
        printf("%d\n", (a[ans + k] + i) % m);
    }
    return 0;
}

题解：字符串最小表示法，但是对于选定了两个起始位置需要快速判断以着两个位置开始的字符串字典序大小关系，所以把整个串hash，之后二分求出使得两个串前缀相同的长度即可判断两个串字典序大小，假设当前加的是i，之前最优位置是x，若没有位置在加i之后变成0，那么最优位置依旧是x，否则枚举所有这种加上i变成0的位置来维护最优解即可，时间复杂度O(nlogn)
题解链接

矩阵

题目链接

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define pm make_pair
#define fi first
#define se second
using namespace std;
const int MAX = 505;
using namespace std;
const ll D1 = 31, D2 = 131;
int n, m;
char a[MAX][MAX];
ull pow1[MAX], pow2[MAX], h[MAX][MAX], tmp, tmp2, Hash[MAX * MAX];
bool ok(int x) {
    memset(h, 0, sizeof h);
    int tot = 0;
    for (int i = 1; i <= n; i++) {
        ull tmp = 0;
        for (int j = 1; j < x; j++)
            h[i][j] = h[i][j - 1] * D1 + a[i][j];
        for (int j = x; j <= m; j++)
            h[i][j] = h[i][j - 1] * D1 + a[i][j] - pow1[x] * a[i][j - x];
    }
    for (int j = x; j <= m; j++) {
        ull tmp = 0;
        for (int i = 1; i < x; i++)
            tmp = tmp * D2 + h[i][j];
        for (int i = x; i <= n; i++)
            Hash[++tot] = tmp * D2 + h[i][j] - pow2[x] * h[i - x][j],
            tmp = Hash[tot];
    }
    sort(Hash + 1, Hash + tot + 1);
    for (int i = 1; i < tot; i++) {
        if (Hash[i] == Hash[i + 1])
            return 1;
    }
    return 0;
}
int main() {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++) {
        scanf("%s", a[i] + 1);
        for (int j = 1; j <= m; j++) {
            a[i][j] -= ('a' - 1);
        }
    }
    int l = 1, r = min(n, m);
    int mid = (l + r) >> 1;
    int ans;
    pow1[0] = pow2[0] = 1;
    for (int i = 1; i <= n; i++)
        pow1[i] = pow1[i - 1] * D1;
    for (int i = 1; i <= m; i++)
        pow2[i] = pow2[i - 1] * D2;
    while (l <= r) {
        mid = (l + r) >> 1;
        if (ok(mid))
            l = mid + 1, ans = mid;
        else
            r = mid - 1;
    }

    printf("%d", ans);
    return 0;
}

题解：用二分枚举出合适的长度，然后用二维字符串哈希对确定边长的矩阵进行处理题目链接