KMP & exKMP & manacher

KMP

#include <bits/stdc++.h>
using namespace std;
char a[1000],b[1000];
int nex[1000],n,m;
void getnext()
{
   int i=0,j=-1;
   nex[0]=-1;
   while(i<m)
   {
       if (b[i] == b[j] || j == -1) {
           i++, j++;
           if(b[i] == b[j])
           nex[i]=nex[j];
           else
           nex[i] = j;
       } else
           j = nex[j];
   }
}
int kmp()
{
   getnext();
   int i=0,j=0;
   while(i<n&&j<m)
   {
       if(j==-1||a[i]==b[j])
       {
           i++;j++;
       }
       else j=nex[j];
   }
   if(j>=m)  return i-j+1;
   else return -1;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie();
    cout.tie();
    cin >> a >> b;
    n=strlen(a);
    m=strlen(b);
    int cnt=kmp();
    cout << cnt << endl;
}

exKMP

回文串朴素算法

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 10;
const int INF = 0x3f3f3f3f;
int cal(string s) {
    int ans = 1;
    for (int i = 0; i < s.length(); i++) {
        for (int j = s.length() - 1; j >= i; j--) {
            int l = i, r = j;
            while (l <= r && s[l++] == s[r--])
                if (l > r) ans = max(ans, j - i + 1);
        }
    }
    return ans;
}
int main() {
    string s;
    getline(cin, s);
    cout << cal(s) << endl;
    return 0;
}

manacher

#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
string s, str;
int p[N];
void add() {
    str += '^';
    for (int i = 0; i < s.size(); i++) {
        str += '#';
        str += s[i];
    }
    str += '#';
    str += '@';
}
void manacher() {
    int r = 0, mid = 0;
    for (int i = 1; i < str.size() - 1; i++) {
        p[i] = r > i ? min(p[2 * mid - i], r - i) : 1;
        while (str[i + p[i]] == str[i - p[i]]) p[i]++;
        if (i + p[i] > r) {
            r = i + p[i];
            mid = i;
        }
    }
}