Girls' research 最长回文串
来源:互联网 发布:开淘宝c店要多少钱 编辑:程序博客网 时间:2024/05/19 11:37
Problem Description
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.
Input
Input contains multiple cases.
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.
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.
Output
Please execute the operation following the two steps.
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.
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.
Sample Input
b babda abcd
Sample Output
0 2azaNo solution!#include<stdio.h>#include<string.h>int main(){ int e,i,j,h,d,len; char ch,str[200005]; while(scanf("%c %s",&ch,str)==2) { h=d=0; len=strlen(str); for(i=0;i<len;i++) { for(j=i+1,e=i;j<len&&e>=0;j++,e--) if(str[e]!=str[j]) break; if(d-h<j-e-2) { h=e+1; d=j-1; } for(j=i+1,e=i-1;j<len&&e>=0;j++,e--) if(str[e]!=str[j]) break; if(d-h<j-e-2) { h=e+1;d=j-1; } } if(d-h>0) { printf("%d %d\n",h,d); for(i=h;i<=d;i++) if(str[i]>=ch) printf("%c",str[i]-ch+'a'); else printf("%c",str[i]-ch+1+'z'); printf("\n"); } else printf("No solution!\n"); getchar(); }}
- Girls' research 最长回文串
- HDU 3294 Girls' research 【最长回文串+字符周期变换】
- HDU 3294 Girls' research【最长回文子串】
- HDU 3294Girls' research最长回文子串(暴力和manacher 两种解法)
- Girls' research(已完善的Manacher算法模板:输出最长回文子串)
- hdoj 3294 Girls' research 【Manacher算法】【输出最长回文子串 + 字符转化】
- hdu 3294 Girls' research Manacher回文串
- hdu3294 Girls' research 回文字符串
- 【回文串】HDU 3294 Girls' research manacher算法
- hdu3294 Girls' research (manacher算法,最大回文子串)
- HDU 3294 Girl's research(最长回文子串)
- HDU 3294 Girls' research(Manacher算法求回文串左右端点)
- Girls' research
- Girls' research
- HDU3294:Girls' research
- hdu 3294 Girls' research
- hdu 3294 Girls' research
- hdu3294---Girls' research
- hdu 4600 Harvest Moon
- VOIP DTMF inband 原理与实现方法
- (Problem 46)Goldbach's other conjecture
- TCP协议实现文件上传的底层代码
- StateListDrawable的使用
- Girls' research 最长回文串
- metasploit之db_autopwn实战
- 全距(Range)
- Hadoop集群运行JNI程序
- Wildcard Matching
- 架构师之路
- JDK环境变量配置
- ORACLE B树索引概念
- 为什么?