Girls' research
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.
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.
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.
Sample Input
b babd a abcd
Sample Output
0 2 aza No solution!
题意:按照题目所给的字符确定a是哪个字符然后全部字符都按这个关系来转换,最后要你找最长的回文串,并输出位置信息
写的有点乱,最后的位置也是乱搞的,没想到竟然过了。。。
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cstdio>
using namespace std;
const int N = 500007;
char s[N], s1[200007];
int p[N];
int main() {
char ch;
while (scanf (" %c %s", &ch, s1) != EOF) {
memset(p, 0, sizeof(p));
int k = 0, len = 0, pos = 0, mx = 0, id = 0;
s[k++] = '$';
s[k++] = '#';
for (int i = 0; s1[i]; ++i) {
s[k++] = s1[i];
s[k++] = '#';
}
s[k] = '\0';
for (int i = 1; s[i]; ++i) {
p[i] = mx > i ? min(p[2*id - i], mx - i) : 1;
while (s[i + p[i]] == s[i - p[i]]) ++p[i];
if (mx < i + p[i]) mx = i + p[i], id = i;
if (len < p[i] - 1) len = p[i] - 1, pos = i;
}
if (len < 2) {
puts("No solution!");
continue;
}
int m = ch - 'a';
k = 0;
for (int i = pos - len; i <= pos + len; ++i) {
if (s[i] == '#') continue;
s1[k++] = (((s[i] - 'a') - m + 26)%26) + 'a';
}
//printf ("pos: %d %d, len: %d\n", pos, pos/2, len);
s1[k] = '\0';
printf ("%d %d\n%s\n", (pos - len + 1)/2-1, (pos - len + 1)/2-1+len-1, s1);
}
return 0;
}