【dp / 中心扩散 / 马拉车】L2-008 最长对称子串 (25 分)

法一：中心扩散

#include<iostream>
#include<string>
using namespace std;
int main(){
	string s;
	getline(cin, s);
	int n = s.size();
	int ans = 0;
	int start = 0;
	int left = 0, right = 0;

	while(start<n)
	{
		if((n-start)*2<ans)
			break;

		while(right+1<n&&s[right]==s[right+1])
			right++;

		start = right + 1;
		while (left > 0 && right +1 < n && s[left - 1] == s[right + 1])
		{
			right++;
			left--;
		}
		ans = max(ans, right - left + 1);
		left = right = start;
	}
	cout << ans;
}

法二：Manacher

#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main(){
	string ss;
	getline(cin, ss);
	int sslen = ss.size();
	int len = sslen * 2 + 1;

	string s;
	for (int i = 0, j = 0; i < len; ++i)
		s += i % 2 ? ss[j++] : '#';
	
	vector<int> r(len);
	int right = 0, center = 0;
	int ans = 0;

	for (int i = 0; i < len;++i){
		if(i<right){
			int j = center * 2 - i;
			if(r[j]<right-i)
				r[i] = r[j];
			else {
				r[i] = right - i;
				while(i-r[i]>=0&&i+r[i]<len&&s[i-r[i]]==s[r[i]+i])
					r[i]++;
			}
		}else{
			r[i] = 1;
			while(i-r[i]>=0&&i+r[i]<len&&s[i-r[i]]==s[r[i]+i])
				r[i]++;
		}

		if(i+r[i]>right){
			right = i + r[i];
			center = i;
		}

		ans = max(ans, r[i]);
	}
	cout <<ans - 1;
	return 0;
}

稍作简化

#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main(){
	string ss;
	getline(cin, ss);
	int sslen = ss.size();
	int len = sslen * 2 + 1;

	string s;
	for (int i = 0, j = 0; i < len; ++i)
		s += i % 2 ? ss[j++] : '#';
	
	vector<int> r(len);
	int right = 0, center = 0;
	int ans = 0;

	for (int i = 0; i < len;++i){
		if(i<right&&r[center*2-i]>=right-i)
            r[i] = right - i;		
		else
			r[i] = 1;
            
		while(i-r[i]>=0&&i+r[i]<len&&s[i-r[i]]==s[r[i]+i])
            r[i]++;

		if(i+r[i]>right){
			right = i + r[i];
			center = i;
		}

		ans = max(ans, r[i]);
	}
	cout <<ans - 1;
	return 0;
}