题目链接:点这里~
题目大意
给你两个字符串s,t,表示字符串s的长度为i的前缀,同理。问满足的{i, j}有多少种组合。1<=|s|,|t|<=1e5
思路
s1,s2是模式串,t是主串。暴力枚举s1,二分长度查找s2,字符串比较用哈希。
获取子串的Hash:has=((hash[r]-hash[l-1]*p^(r-l+1))%mod+mod)%mod;
(如果需反复求解子串hash,则对p的次方进行预处理效果更佳)
ac代码
#include<bits/stdc++.h>
using namespace std;
#define io cin.tie(0);ios::sync_with_stdio(false);
#define debug(x) cout<<#x<<"="<<x<<endl
#define lowbit(x) x&(-x)
#define pii pair<int,int>
#define mk make_pair
#define ll long long
#define ull unsigned long long
#define lb long double
#define rs p<<1|1
#define ls p<<1
#define eps 1e-12
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
const ll inf = 1e18;
const int bas = 2333;
inline ll read(){
ll p=0,f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){p=(p<<1)+(p<<3)+(c^48),c=getchar();}
return f*p;
}
ll _pow(ll a, ll b){
ll ans = 1;
while(b){
if(b & 1) ans = ans * a % mod;
a = a * a % mod;
b >>= 1;
}
return ans;
}
ll get(ll a[], int l, int len){ //获取子串的hash值
int r = l + len - 1;
if(l == 0) return a[r];
return (a[r] - a[l - 1] * _pow(bas, r - l + 1) % mod + mod) % mod;
}
void _hash(string s, ll a[]){ //hash值存数组
int n = s.length();
for(int i = 0; i < n; i ++){
if(i) a[i] = (a[i - 1] * bas + s[i] - 'a' + 1) % mod;
else a[i] = s[i] - 'a' + 1;
}
}
ll a[maxn], b[maxn];
void solve(){
string s1, s2;
cin >> s1 >> s2;
_hash(s1, a);
_hash(s2, b);
int n = s1.length(), m = s2.length();
ll ans = 0; //答案会爆int,需要用long long
for(int i = 0; i < n; i ++){
if(s1[i] != s2[i]) break;//说明左边那个模式串不满足条件
int l = 1, r = n, res = 0;
while(l <= r){ //二分右边模式串长度
int mid = l + r >> 1;
if(i + mid >= m){ //两个模式串长度超过主串
r = mid - 1;
continue;
}
ll _s = get(a, 0, mid);
ll _t = get(b, i + 1, mid);
if(_s == _t){
l = mid + 1, res = mid;
}else{
r = mid - 1;
}
}
ans += res; //模式串的最大长度就是最多数量
}
cout << ans << endl;
}
int main(){
io;
solve();
return 0;
}