字符串哈希可在 O ( n l o g n ) O(nlogn) O(nlogn) 的时间复杂度里求kmp的next数组,Z函数,以及马拉车的mlc数组,适合在无资料的考场上DIY
最好用的字符串双哈希(带反哈希判断回文串)
struct string_hash{
const int nn;
const ll Base1 = 29, MOD1 = 1e9 + 7;
const ll Base2 = 131, MOD2 = 1e9 + 9;
vector<ll> ha1, ha2, pow1, pow2;
vector<ll> rha1, rha2;
string_hash(const string &ss,int n1) : nn(n1), ha1(nn + 1), ha2(nn + 1), pow1(nn + 1), pow2(nn + 1), rha1(nn + 1), rha2(nn + 1)
{
pow1[0] = pow2[0] = 1;
for(int i = 1; i <= nn; i++)
{
pow1[i] = pow1[i - 1] * Base1 % MOD1;
pow2[i] = pow2[i - 1] * Base2 % MOD2;
}
for(int i = 1; i <= nn; i++)
{
ha1[i] = (ha1[i - 1] * Base1 + ss[i - 1]) % MOD1;
ha2[i] = (ha2[i - 1] * Base2 + ss[i - 1]) % MOD2;
rha1[i] = (rha1[i - 1] * Base1 + ss[nn - i]) % MOD1;
rha2[i] = (rha2[i - 1] * Base2 + ss[nn - i]) % MOD2;
}
}
pair<ll, ll> get_hash(int l,int r)
{
ll res1 = ((ha1[r] - ha1[l - 1] * pow1[r - l + 1]) % MOD1 + MOD1) % MOD1;
ll res2 = ((ha2[r] - ha2[l - 1] * pow2[r - l + 1]) % MOD2 + MOD2) % MOD2;
return {res1, res2};
}
pair<ll, ll> get_rhash(int l, int r)
{
ll res1 = ((rha1[n - l + 1] - rha1[n - r] * pow1[r - l + 1]) % MOD1 + MOD1) % MOD1;
ll res2 = ((rha2[n - l + 1] - rha2[n - r] * pow2[r - l + 1]) % MOD2 + MOD2) % MOD2;
return {res1, res2};
}
bool is_palindrome(int l, int r)//判断ss[l, r]是否为回文串
{
return get_hash(l, r) == get_rhash(l, r);
}
pair<ll, ll> add(pair<ll, ll> aa,pair<ll, ll> bb)
{
ll res1 = (aa.f + bb.f) % MOD1;
ll res2 = (aa.s + bb.s) % MOD2;
return {res1, res2};
}
pair<ll, ll> mul(pair<ll, ll> aa, ll kk) //aa *= Base的k次方
{
ll res1 = aa.f * pow1[kk] % MOD1;
ll res2 = aa.s * pow2[kk] % MOD2;
return {res1, res2};
}
pair<ll, ll> pin(int l1, int r1, int l2, int r2) //拼接字符串 r1 < l2 ss = s1 + s2
{
return add(mul(get_hash(l2, r2), r1 - l1 + 1), get_hash(l1, r1));
}
};
普通字符串双哈希
struct string_hash{
const int nn;
const ll Base1 = 29, MOD1 = 1e9 + 7;
const ll Base2 = 131, MOD2 = 1e9 + 9;
vector<ll> ha1, ha2, pow1, pow2;
string_hash(const string &ss, int n1) : nn(n1), ha1(nn + 1), ha2(nn + 1), pow1(nn + 1), pow2(nn + 1)
{
pow1[0] = pow2[0] = 1;
for(int i = 1; i <= nn; i++)
{
pow1[i] = pow1[i - 1] * Base1 % MOD1;
pow2[i] = pow2[i - 1] * Base2 % MOD2;
}
for(int i = 1; i <= nn; i++)
{
ha1[i] = (ha1[i - 1] * Base1 + ss[i - 1]) % MOD1;
ha2[i] = (ha2[i - 1] * Base2 + ss[i - 1]) % MOD2;
}
}
pair<ll, ll> get_hash(int l, int r)
{
ll res1 = ((ha1[r] - ha1[l - 1] * pow1[r - l + 1]) % MOD1 + MOD1) % MOD1;
ll res2 = ((ha2[r] - ha2[l - 1] * pow2[r - l + 1]) % MOD2 + MOD2) % MOD2;
return {res1, res2};
}
bool same(int l1, int r1, int l2, int r2)
{
return get_hash(l1, r1) == get_hash(l2, r2);
}
pair<ll, ll> add(pair<ll, ll> aa,pair<ll, ll> bb)
{
ll res1 = (aa.f + bb.f) % MOD1;
ll res2 = (aa.s + bb.s) % MOD2;
return {res1, res2};
}
pair<ll, ll> mul(pair<ll, ll> aa, ll kk) //aa *= Base的k次方
{
ll res1 = aa.f * pow1[kk] % MOD1;
ll res2 = aa.s * pow2[kk] % MOD2;
return {res1, res2};
}
pair<ll, ll> pin(int l1, int r1, int l2, int r2) //拼接字符串 r1 < l2 ss = s1 + s2
{
return add(mul(get_hash(l2, r2), r1 - l1 + 1), get_hash(l1, r1));
}
};
普通字符串双哈希(最快的版本)
const int maxn = 5000010;
char s1[maxn];
ll ha1[maxn], pow1[maxn], rha1[maxn];
struct string_hash{
const int nn;
const ll Base1 = 29, MOD1 = 1e9 + 7;
string_hash(int n1) : nn(n1)
{
pow1[0] = 1;
for(int i = 1; i <= nn; i++)
pow1[i] = pow1[i - 1] * Base1 % MOD1;
for(int i = 1; i <= nn; i++)
{
ha1[i] = (ha1[i - 1] * Base1 + s1[i - 1]) % MOD1;
rha1[i] = (rha1[i - 1] * Base1 + s1[nn - i]) % MOD1;
}
}
int get_hash(int l,int r)
{
int res1 = ((ha1[r] - ha1[l - 1] * pow1[r - l + 1]) % MOD1 + MOD1) % MOD1;
return res1;
}
int get_rhash(int l, int r)
{
int res1 = ((rha1[n - l + 1] - rha1[n - r] * pow1[r - l + 1]) % MOD1 + MOD1) % MOD1;
return res1;
}
bool same(int l1, int r1, int l2, int r2)
{
return get_hash(l1, r1) == get_hash(l2, r2);
}
ll add(ll aa,ll bb)
{
ll res = (aa + bb) % MOD1;
return res;
}
ll mul(ll aa, ll kk) //aa *= Base的k次方
{
ll res = aa * pow1[kk] % MOD1;
return res;
}
ll pin(int l1, int r1, int l2, int r2) //拼接字符串 r1 < l2 ss = s1 + s2
{
return add(mul(get_hash(l2, r2), r1 - l1 + 1), get_hash(l1, r1));
}
};