牛客练习赛79 D 回文字D 字符串哈希+贪心

原题链接：https://ac.nowcoder.com/acm/contest/11169/D

题意

分析

既然对于小于D的字符串都属于D型回文串，我们直接大胆一点，找[i, i+d-1]位置的字符串是否是回文串，如果是，那么可以继续将左端点右移，直到失配为止，然后将左端点的值变成i+d-1。

然后就是怎么O(1)判断回文串，我们只需要前后预处理一遍字符串哈希就可以了。

Code

#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
//#define ACM_LOCAL
#define re register
#define fi first
#define se second
#define please_AC return 0
const int N = 1e7 + 10;
const int M = 1e6 + 10;
const int INF = 1e9;
const double eps = 1e-4;
const int MOD = 1e9 + 7;
typedef long long ll;
typedef unsigned long long ull;
string s;
ull f1[N], f2[N], p[N];
int n, d;
ull get1(int l, int r) {
    return f1[r] - f1[l-1] * p[r-l+1];
}
ull get2(int l, int r) {
    return f2[r] - f2[l-1] * p[r-l+1];
}
bool check(int l, int r) {
    return get1(l, r) == get2(n-r+1, n-l+1);
}
void solve() {
    cin >> n >> d;
    cin >> s;
    p[0] = 1;
    for (int i = 1; i <= n; i++) {
        f1[i] = f1[i-1] * 1331 + s[i-1];
        f2[i] = f2[i-1] * 1331 + s[n-i];
        p[i] = p[i-1] * 1331;
    }
    int ans = 0;
    for (int l = 1; l <= n;) {
        while (l+d-1 <= n && check(l, l+d-1)) l++;
        l = l + d - 1;
        ans++;
    }
    cout << ans << endl;
}

signed main() {
#ifdef ACM_LOCAL
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#endif
    solve();
    return 0;
}