哈希模板

http://acm.hdu.edu.cn/showproblem.php?pid=1711
题意
判断第二个序列是否是第一个序列的子序列，如果是，找到第一个匹配的位置
题解

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 1e6 + 10, N = 1e6 + 1;
ll h[2][maxn], p[2][maxn];//双hash
int base[2] = {10000019, 10000079}, mod[2] = {1000000007, 998244353};//base要大于最大的数
void init(int n) {
    p[0][0] = p[1][0] = 1;
    for (int i = 0; i < 2; i++)
        for (int j = 1; j <= n; j++)
            p[i][j] = p[i][j - 1] * base[i] % mod[i];
}
ll get(int l, int r, int i) {
    return (h[i][r] - h[i][l - 1] * p[i][r - l + 1] % mod[i] + mod[i]) % mod[i];
}
int main() {
    init(1000000);
    int T;
    scanf("%d", &T);
    while (T--) {
        int n, m, x;
        scanf("%d%d", &n, &m);
        for (int i = 1; i <= n; i++) {
            scanf("%d", &x);
            x += N; //负数转化成正数
            h[0][i] = (h[0][i - 1] * base[0] + x) % mod[0];
            h[1][i] = (h[1][i - 1] * base[1] + x) % mod[1];
        }
        ll H[2] = {0, 0};
        for (int i = 1; i <= m; i++) {
            scanf("%d", &x);
            x += N;
            H[0] = (H[0] * base[0] + x) % mod[0];
            H[1] = (H[1] * base[1] + x) % mod[1];
        }
        int k = -1;
        for (int i = 1; i + m - 1 <= n; i++)
        if (get(i, i + m - 1, 0) == H[0] && get(i, i + m - 1, 1) == H[1]) {
            k = i;
            break;
        }
        printf("%d\n", k);
    }
}