HDOJ 3294 Girls' research
来源:互联网 发布:淘宝ip地址查询 编辑:程序博客网 时间:2024/06/05 17:31
Girls' research
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1004 Accepted Submission(s): 380
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!
Author
wangjing1111
Source
2010 “HDU-Sailormoon” Programming Contest
#include <cstdio>#include <cstring>const int N = 400010;char str[N];int p[N];inline int min(int a, int b) { return a < b ? a : b;}int main() { char d[2]; while (~scanf("%s%s", d, str)) { int len = strlen(str); int t = 'a' - d[0]; for (int i = len; i >= 0; --i) { str[i << 1 | 1] = 'a' + (str[i] - 'a' + t + 26) % 26; str[i << 1] = '$'; } str[len * 2 + 1] = 0; len = len * 2 + 1; int id = 0, max_len = 0; int start, end; for (int i = 0; i < len; ++i) { if (id + p[id] > i) p[i] = min(p[id * 2 - i], p[id] + id - i); else p[i] = 1; while (i - p[i] >= 0 && str[i - p[i]] == str[i + p[i]]) ++p[i]; if (i + p[i] > id + p[id]) id = i; if (max_len < p[i]){ max_len = p[i]; start = i - max_len + 2; end = i + max_len - 2; } } if (max_len < 3) puts("No solution!"); else { printf("%d %d\n", start / 2, end / 2); for (int i = start; i <= end; i += 2) printf("%c", str[i]); puts(""); } } return 0;}
0 0
- HDOJ 3294 Girls' research
- hdu 3294 Girls' research
- hdu 3294 Girls' research
- HDU 3294 Girls' research
- hdu 3294 Girls' research
- HDU 3294Girls' research
- hdoj 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
- hdoj 3294 Girls' research 【Manacher算法】【输出最长回文子串 + 字符转化】
- Girls' research
- Girls' research
- HDU 3294 Girls' research 字符串-manacher算法
- HDU 3294 Girls' research (manacher)
- hdu 3294 Girls' research Manacher回文串
- linux新建用户切换后显示-bash-4.1$
- LeetCode解题报告--2Sum, 3Sum, 4Sum, K Sum求和问题总结
- svn常用命令行和批处理
- 十宗罪 第一节 前言
- Service 初步(1)
- HDOJ 3294 Girls' research
- Flex DateField TypeError 1009 stringToDate 异常解决
- iOS中json解析出现的null问题
- _IO, _IOR, _IOW, _IOWR 宏的用法与解析
- mysql进程SHOW PROCESSLIST
- 享元模式Flyweight——结构型模式
- linux mongodb makefile 示例
- 黑马程序员-[C语言] 第四篇:文件操作总结
- 【Java并发编程实战】—–“J.U.C”:ReentrantLock之一简介