zoukankan      html  css  js  c++  java
  • U

    Andy the smart computer science student was attending an algorithms class when the professor asked the students a simple question, "Can you propose an efficient algorithm to find the length of the largest palindrome in a string?" 

    A string is said to be a palindrome if it reads the same both forwards and backwards, for example "madam" is a palindrome while "acm" is not. 

    The students recognized that this is a classical problem but couldn't come up with a solution better than iterating over all substrings and checking whether they are palindrome or not, obviously this algorithm is not efficient at all, after a while Andy raised his hand and said "Okay, I've a better algorithm" and before he starts to explain his idea he stopped for a moment and then said "Well, I've an even better algorithm!". 

    If you think you know Andy's final solution then prove it! Given a string of at most 1000000 characters find and print the length of the largest palindrome inside this string.

    Input

    Your program will be tested on at most 30 test cases, each test case is given as a string of at most 1000000 lowercase characters on a line by itself. The input is terminated by a line that starts with the string "END" (quotes for clarity). 

    Output

    For each test case in the input print the test case number and the length of the largest palindrome. 

    Sample Input

    abcbabcbabcba
    abacacbaaaab
    END

    Sample Output

    Case 1: 13
    Case 2: 6
    #include<iostream>
    #include<algorithm>
    #include<cstdio>
    #include<vector>
    #include<string>
    #include<map>
    #include<cstring>
    #include<fstream>
    using namespace std;
    #define MAXN 1000003
    typedef long long LL;
    /*
    最长回文串的长度
    */
    char a[MAXN];
    char s[MAXN*2];
    int r[MAXN*2];
    void Manacher(int len)
    {
        int p=0;
        s[p++] = '$';
        s[p++] = '#';
        for(int i=0;i<len;i++)
        {
            s[p++] = a[i];
            s[p++] = '#';
        }
        s[p] = 0;
        
        int Mx = 0,pos = 0;
        for(int i=0;i<p;i++)
        {
            r[i] = (i<Mx)? min(Mx-i,r[2*pos-i]):1;
            while(s[i+r[i]]==s[i-r[i]])
                r[i]++;
            if(i+r[i]>Mx)
            {
                Mx = i+r[i];
                pos = i;
            }
        }
    }
    int main()
    {
        int cas = 1;
        while(scanf("%s",a),a[0]!='E')
        {
            int l = strlen(a);
            Manacher(l);
            int ans = 1;
            for(int i=0;i<2*l+2;i++)
            {
                ans = max(ans,r[i]-1);
            }
            printf("Case %d: %d
    ",cas++,ans);
        }
    }
  • 相关阅读:
    LUA 数据比较BUG?????是不是BUG大佬帮看看
    win10 优化批处理
    android Studio 二维码扫一扫 使用精简过的zxing
    AppCompatActivity 去除标题栏
    java 继承 重写 重载 super关键字
    java构造方法私有化
    java代码块的理解
    java 理解main方法
    java面向对象基础static
    docker 安装 nginx
  • 原文地址:https://www.cnblogs.com/joeylee97/p/6692951.html
Copyright © 2011-2022 走看看