Longest Symmetric String (25) 与Manacher算法

求最长回文子串问题。数据量比较小，可以进行暴力破解。

但有一种更好的算法，

Manacher 算法。

详见：https://segmentfault.com/a/1190000003914228

题目代码：

#include "iostream"
#include "vector"
#include "string"
#include "cstring"
#include "queue"
#include "stack"
#include "map"
#include "ctime"
#include <limits.h>
#include <algorithm>
using namespace std;

const int maxn = 1010;
int RL[maxn * 2];

vector<char> str;
int main()
{
	char temp;
	str.push_back('#');
	while (1)
	{
		temp = getchar();
		if (temp == '\n')
			break;
		str.push_back(temp);
		str.push_back('#');
	}

	int MaxRight = 0, pos = 0, maxLen = 0;
	for (int i = 0; i < str.size(); ++i)
	{
		if (i < MaxRight)
			RL[i] = min(RL[2 * pos - i], MaxRight - i);
		else
			RL[i] = 1;

		while (i - RL[i] >= 0 && i + RL[i] < str.size() && str[i - RL[i]] == str[i + RL[i]])
			RL[i] += 1;
		if (RL[i] + i - 1 > MaxRight)
		{
			MaxRight = RL[i] + i - 1;
			pos = i;
		}
		if (RL[i] > maxLen)
			maxLen = RL[i];
	}
	cout << maxLen - 1;
}