HDU 3294 Girls' research(Manacher算法求回文串左右端点)
来源:互联网 发布:淘宝店铺分析报告 编辑:程序博客网 时间:2024/05/17 01:11
One day, sailormoon girls are so delighted that they intend to research about palindromic strings. Operation contains two steps:
First step: girls will write a long string (only contains lower case) on the paper. For example, "abcde", but 'a' inside is not the real 'a', that means if we define the 'b' is the real 'a', then we can infer that 'c' is the real 'b', 'd' is the real 'c' ……, 'a' is the real 'z'. According to this, string "abcde" changes to "bcdef".
Second step: girls will find out the longest palindromic string in the given string, the length of palindromic string must be equal or more than 2.
First step: girls will write a long string (only contains lower case) on the paper. For example, "abcde", but 'a' inside is not the real 'a', that means if we define the 'b' is the real 'a', then we can infer that 'c' is the real 'b', 'd' is the real 'c' ……, 'a' is the real 'z'. According to this, string "abcde" changes to "bcdef".
Second step: girls will find out the longest palindromic string in the given string, the length of palindromic string must be equal or more than 2.
Each case contains two parts, a character and a string, they are separated by one space, the character representing the real 'a' is and the length of the string will not exceed 200000.All input must be lowercase.
If the length of string is len, it is marked from 0 to len-1.
If you find one, output the start position and end position of palindromic string in a line, next line output the real palindromic string, or output "No solution!".
If there are several answers available, please choose the string which first appears.
b babda abcd
0 2azaNo solution!
题解:
题意:
先给你一个字符,代表该字符表示‘a’,然后其他25个字符根据该字符来推算,然后给你一个串,让你求出最长回文串的左右端点,如果相等长输出找到的第一个串,并输出根据要求改变后的回文串
思路:
manacher里面稍加修改就行了,就是他一开始输入的字符处理起来有点麻烦。。推算一下就好了
代码:
#include<iostream>#include<cstring>#include<stdio.h>#include<math.h>#include<string>#include<stdio.h>#include<queue>#include<stack>#include<map>#include<vector>#include<deque>#include<algorithm>using namespace std;#define lson k*2#define rson k*2+1#define M (t[k].l+t[k].r)/2#define INF 100861111#define ll long long#define eps 1e-15int p[400005];int v[30];char str[400005];int l,r;int manacher(char s[])//模板稍加修改{ int i; for(i=1;s[i];i++) str[i*2]=s[i],str[i*2+1]='#'; str[0]='?',str[1]='#',str[i*2]='\0'; int res=0, k=0,maxk=0; for(int i = 2; str[i]; i++) { p[i]=i<maxk?min(maxk-i,p[2*k-i]):1; while(str[i-p[i]]==str[i+p[i]]) p[i]++; if(p[i]+i>maxk) { k=i,maxk=i+p[i]; } if(res<p[i]) { l=(i-p[i])/2;//这个地方修改了求左右端点 r=(i+p[i])/2-2; res=p[i]; } } return res-1;}int main(){ int test,i,j,t; char s[200005],c[10]; while(scanf("%s%s",&c,s+1)!=EOF) { for(i=c[0]-'a',j=0;i<26;i++,j++)//也就是推算下其他字符的值 v[i]=j; for(i=c[0]-'a'-1,j=-1;i>=0;i--,j--) v[i]=j; t=manacher(s); if(t<2) { printf("No solution!\n"); } else { printf("%d %d\n",l,r); l++,r++; for(i=l;i<=r;i++) { if(v[s[i]-'a']>=0) printf("%c",v[s[i]-'a']+'a'); else printf("%c",26+v[s[i]-'a']+'a'); } printf("\n"); } } return 0;}
阅读全文
0 0
- HDU 3294 Girls' research(Manacher算法求回文串左右端点)
- 【回文串】HDU 3294 Girls' research manacher算法
- hdu 3294 Girls' research Manacher回文串
- HDU 3294 Girls' research 字符串-manacher算法
- HDU 3294 Girls' research (manacher)
- hdu3294 Girls' research (manacher算法,最大回文子串)
- [manacher] hdu 3294 Girls' research
- hdu 3294 Girls' research(manacher)
- HDU - 3294 Girls' research(manacher)
- hdu 3294 Girls' research【manacher】
- HDU 3294 Girls’ research Manacher
- HDU 3294Girls' research最长回文子串(暴力和manacher 两种解法)
- hdoj 3294 Girls' research 【Manacher算法】【输出最长回文子串 + 字符转化】
- Girls' research(已完善的Manacher算法模板:输出最长回文子串)
- HDU 3294 Girls' research (Manacher算法 + 记录区间)
- HDU 3294 Girls' research (Manacher算法 + 记录区间)
- HDU 3294 Girls' research (manacher模板题)
- HDU.3294 Girls' research Manacher Algorithm
- Keras 切换后端(Theano和TensorFlow)
- STM32的SYSTICK详解(认识1)
- Java 网络IO编程总结(BIO、NIO、AIO均含完整实例代码)
- python的__name__和__main__
- Tomcat
- HDU 3294 Girls' research(Manacher算法求回文串左右端点)
- bootstrap下的弹出框加载select2框架失败的解决
- Java必懂之命名规范
- (lintcode)第11题二叉查找树中搜索区间
- 多线程应用程序
- jenkins用户手册-8-使用jenkins
- 【数论】 欧几里德 扩展欧几里德 乘法逆元 挑战程序P115
- Oracle 高水位线查询(show_space)
- C语言高级应用——把握N级指针