HDOJ 3294 Girls' research

最新推荐文章于 2022-04-30 19:23:50 发布

原创最新推荐文章于 2022-04-30 19:23:50 发布 · 338 阅读

0 ·

CC 4.0 BY-SA版权

Manacher 专栏收录该内容

4 篇文章

订阅专栏

本文概述了AI音视频处理领域的关键技术，包括视频分割、语义识别、自动驾驶、AR、SLAM等，并探讨了其在实际应用中的作用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

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!

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;
}