摘要：
// 原串最大长度N// 返回最大回文字串 res#include<cstdio>#include<cstring>#include<cstdlib>#include<string>#include<algorithm>using namespace std;const int N = 1024;int rid[N<<2];string manacher(char *s){ string t, res; int L = strlen(s); // init t += '?'; for(int i = 0; 阅读全文
摘要：
算法内容http://blog.sina.com.cn/s/blog_70811e1a01014esn.html题目直接看输出即可， 注意前后放 ? #, #*. 然后找最大回文串长度应该是 rid[i]*2 + (str[i] =='#')#include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>#include<string>using namespace std;const int N = 1024;char s[N];int rid 阅读全文