【数据结构】---Manacher算法

最新推荐文章于 2022-05-29 18:44:45 发布

DoriLee

最新推荐文章于 2022-05-29 18:44:45 发布

阅读量244

点赞数

分类专栏：数据结构

本文链接：https://blog.csdn.net/qq_27679107/article/details/79318718

版权

数据结构专栏收录该内容

4 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <cstring>
#include <cmath>
#define MAXSIZE 110000
using namespace std;
int pArr[MAXSIZE * 2 + 5];
char str[MAXSIZE + 5];
char charArr[MAXSIZE * 2 + 5];
void manacherString(){
    charArr[0] = '#';
    int len = strlen(str);
    int cnt = 1;
    for(int i=0; i < len; i++){
        charArr[cnt++] = str[i];
        charArr[cnt++] = '#';
    }
    charArr[cnt] = '\0';
}

int maxLcpsLength(){
    int len1 = strlen(str);
    if(len1 == 0 || len1 == 1) return len1;
    manacherString();
    int len = strlen(charArr);
    int C = -1;
    int R = -1;
    int Max = 0;
    for(int i = 0;i != len; i++){
        pArr[i] = R > i ? min(pArr[2 * C - i], R - i) : 1;
        while(i + pArr[i] < len && i - pArr[i] > -1){
            if(charArr[i + pArr[i]] == charArr[i - pArr[i]])
                pArr[i]++;
            else
                break;
        }
        if(i + pArr[i] > R){
            R = i + pArr[i];
            C = i;
        }
        Max = max(Max, pArr[i]);
    }
    return Max - 1;
}
int main(){
    while(scanf("%s",str) != EOF){
        memset(pArr, 0, sizeof(pArr));
        charArr[0] = '\0';
        printf("%d\n", maxLcpsLength());
    }
    return 0;
}