字符串hash

模板(详)：

#include <bits/stdc++.h>
#define ull unsigned long long
using namespace std;
const int N = 1e5+5;
ull p[N], hash1[N], hash2[N], bas = 233;
char s1[N], s2[N];
void init()
{
	p[0] = 1;
	hash1[0] = hash2[0] = 0;
	int len1 = strlen(s1+1);
	int len2 = strlen(s2+1);
	for(int i = 1; i <= 100000; ++i) p[i] = p[i-1]*bas;
	for(int i = 1; i <= len1; ++i)
	hash1[i] = hash1[i-1]*bas + (s1[i]-'a');
	for(int i = 1; i <= len2; ++i)
	hash2[i] = hash2[i-1]*bas + (s2[i]-'a');
}
ull check(int l, int r, ull hash[])
{
	return hash[r] - hash[l-1]*p[r-l+1];
}
int main()
{
	scanf("%s", s1+1);
	scanf("%s", s2+1);
	init();
	int l1, r1, l2, r2;
	while(~scanf("%d %d %d %d", &l1, &r1, &l2, &r2))
	{
		check(l1, r1, hash1) == check(l2, r2, hash2)? puts("true"): puts("false");
	}
	return 0;
}

继续加油~