Manacher算法模板

Manacher算法用于计算最长回文串的长度，时间复杂度为

需要先对字符串进行预处理，方便统一处理偶数和奇数字符串，具体为将abba变为$#a#b#b#a#&

之后再通过一个分类讨论，主要是优化了已经计算过的子回文串长度的重复计算，具体的讨论以及推导还是看书吧，能看懂但讲不出来阿巴阿巴。

一、模板

Problem - 3068 (hdu.edu.cn)

#include<iostream>
#include<stdio.h>
#include<cstring>
#include<string.h>
#include<algorithm>
using namespace std;
#define qio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
typedef long long ll;
typedef double db;

const int N = 2e5 + 10;
int n, p[N << 1]; //p[i]为以s[i]为中心的回文半径
char a[N], s[N << 1];

void change(){  //字符串abba变换为：$ # a # b # b # a # &
	n = strlen(a);
	int k = 0;
	s[k++] = '$', s[k++] = '#';
	for(int i = 0; i < n; i++){
		s[k++] = a[i];
		s[k++] = '#';
	}
	s[k++] = '&';
	n = k;
}
void manacher(){
	int r = 0, c;
	for(int i = 1; i < n; i++){
		if(i < r){
			p[i] = min(p[(c << 1) - i], p[c] + c - i); //合并处理两种情况
		}else{
			p[i] = 1;
		}
		while(s[i + p[i]] == s[i - p[i]]) p[i]++; //暴力中心扩展法
		if(p[i] + i > r){ // 更新最大r
			r = p[i] + i;
			c = i;
		}
		
	}
}

void solve() {
	while(cin >> a){
		memset(p, 0, sizeof p);
		change();
		manacher();
		cout << *max_element(p, p + n) - 1 << '\n';
	}
}

signed main() {
	qio
	int T = 1;
//	cin >> T;
	while (T--)	solve();
}

二、简单例题

Problem - 3294 (hdu.edu.cn)

回文串左右边界 l = (pos - ans) / 2, r = (pos + ans - 3) / 2

#include<iostream>
#include<stdio.h>
#include<cstring>
#include<string.h>
#include<algorithm>
using namespace std;
#define qio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
typedef long long ll;
typedef double db;

const int N = 2e5 + 10;
int n, p[N << 1]; //p[i]为以s[i]为中心的回文半径
char a[N], s[N << 1], t;

void change(){  //字符串abba变换为：$ # a # b # b # a # &
	n = strlen(a);
	int k = 0;
	s[k++] = '$', s[k++] = '#';
	for(int i = 0; i < n; i++){
		s[k++] = a[i];
		s[k++] = '#';
	}
	s[k++] = '&';
	n = k;
}
void manacher(){
	int r = 0, c;
	for(int i = 1; i < n; i++){
		if(i < r){
			p[i] = min(p[(c << 1) - i], p[c] + c - i); //合并处理两种情况
		}else{
			p[i] = 1;
		}
		while(s[i + p[i]] == s[i - p[i]]) p[i]++; //暴力中心扩展法
		if(p[i] + i > r){ // 更新最大r
			r = p[i] + i;
			c = i;
		}	
	}
}
	

void solve() {
	while(cin >> t >> a){
		memset(p, 0, sizeof p);
		change();
		manacher();
		int ans = 0, pos = 0;
		for(int i = 0; i < n; i++){
			if(p[i] > ans){
				ans = p[i];
				pos = i;
			}
		}
		if(ans - 1 < 2){
			cout << "No solution!\n";
		}else{
			int l = (pos - ans) / 2, r = (pos + ans - 3) / 2;
			cout << l << ' ' << r << '\n';
			for(int i = l; i <= r; i++){
				char c = (a[i] - t + 26) % 26 + 'a';
				cout << c;
			}
			cout << '\n';
		}	
	}
}

signed main() {
	qio
	int T = 1;
//	cin >> T;
	while (T--)	solve();
}

三、稍复杂例题

Problem - 4513 (hdu.edu.cn)

while循环中加入判断条件即可，不为0则和往前第二个比较即可，不知道为什么用cin，cout会TLE

#include<iostream>
#include<stdio.h>
#include<cstring>
#include<string.h>
#include<algorithm>
using namespace std;
#define qio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
typedef long long ll;
typedef double db;

const int N = 1e5 + 10;
int n, p[N << 1]; //p[i]为以s[i]为中心的回文半径
int a[N], s[N << 1];

inline void change() { //字符串abba变换为：$ # a # b # b # a # &
	int k = 0;
	s[k++] = -1, s[k++] = 0;
	for (int i = 0; i < n; i++) {
		s[k++] = a[i];
		s[k++] = 0;
	}
	s[k++] = -2;
	n = k;
}
inline void manacher() {
	int ans = 0;
	int r = 0, c;
	for (int i = 1; i < n; i++) {
		if (i < r) {
			p[i] = min(p[(c << 1) - i], p[c] + c - i); //合并处理两种情况
		} else {
			p[i] = 1;
		}
		while (i + p[i] < n && i - p[i] >= 0 && s[i + p[i]] == s[i - p[i]]) {
			if(s[i + p[i]] == 0){
				p[i]++;
			}else if(s[i - p[i]] <= s[i - p[i] + 2] && s[i + p[i]] <= s[i + p[i] - 2]){
				p[i]++;
			}else break;			
		} 
		if (p[i] + i > r) { // 更新最大r
			r = p[i] + i;
			c = i;
		}
		ans = max(ans, p[i]);
	}
	printf("%d\n", ans - 1);
}

void solve() {
	scanf("%d", &n);
	for(int i = 0; i < n; i++) scanf("%d", &a[i]);
//	memset(p, 0, sizeof p);
	change();
	manacher();
}

signed main() {
	qio
	int T = 1;
	cin >> T;
	while (T--)	solve();
}