[回文子串长度] manacher算法得到任意子区间的回文长度

vector<int> manacher1(string s){
	string t;
	for(auto &c:s){
		t += string("#") + c;
	}
	t += string("#");
	int n = t.length();
	t = "$" + t + "^";
	vector<int> p(n+2);
	int l = 1,r = 1;
	for(int i = 1 ; i <= n ;i++){
		p[i] = max(0,min(r-i,p[l+r-i]));
		while(t[i - p[i]] == t[i+p[i]]){
			p[i]++;
		}
		if(i + p[i] > r){
			l = i - p[i];
			r = i + p[i];
		}
	}
	return vector<int>(begin(p)+2,end(p)-2);
}

if(v[l+r] < len) 则子区间 [l,r]不为回文子串