![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
poj manacher
lihaogegehuting
这个作者很懒,什么都没留下…
展开
-
poj 3974 Palindrome
边吃边敲,效率就是高 代码如下: #include #include #define MAX 1000050 char s[MAX],ss[MAX*2]; int p[MAX*2]; int min(int a,int b){return a>b?b:a;} int main() { int i,id,mx,max,n,j; j=1; while(scanf("%s",s原创 2014-07-18 21:34:44 · 811 阅读 · 0 评论 -
hdu 3294 Girls' research
#include #include #define MAX 200020 char s[MAX],ss[MAX*2],str[2]; int p[MAX*2]; int chance(char s) { return (s- str[0] + 26) % 26 + 'a'; } int min(int a,int b){return a>b?b:a;} int main() {原创 2014-07-19 01:16:44 · 1212 阅读 · 0 评论