zoukankan      html  css  js  c++  java
  • (manacher算法) poj 3974

    Palindrome
    Time Limit: 15000MS   Memory Limit: 65536K
    Total Submissions: 5193   Accepted: 1867

    Description

    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<cstdio>
    #include<cstring>
    #include<cmath>
    #include<string>
    #include<algorithm>
    #include<cstdlib>
    #include<queue>
    #include<vector>
    #include<set>
    #include<stack>
    #include<queue>
    using namespace std;
    int p[2000005],len,cas;
    char s[2000005],str[1000005];
    void build()
    {
        s[0]='@';
        s[1]='#';
        len=strlen(str);
        for(int i=0;i<len;i++)
        {
            s[2*i+2]=str[i];
            s[2*i+3]='#';
        }
        s[2*len+2]='';
    }
    void solve()
    {
        int mx=0,id,ans=1;
        len=2*len+2;
        for(int i=0;i<len;i++)
        {
            if(mx>i)
                p[i]=min(mx-i,p[2*id-i]);
            else p[i]=1;
            for(;s[i-p[i]]==s[i+p[i]];p[i]++)
            {
                if(i+p[i]>mx)
                {
                    mx=i+p[i];
                    id=i;
                }
            }
            ans=max(ans,p[i]);
        }
        printf("Case %d: %d
    ",++cas,ans-1);
    }
    int main()
    {
        while(scanf("%s",str)!=EOF)
        {
            if(strcmp(str,"END")==0)
                break;
            build();
            solve();
        }
        return 0;
    }
    

      

  • 相关阅读:
    准备使用 Office 365 中国版--邮箱迁移
    准备使用 Office 365 中国版--域名
    中国版的 Office 365
    了解 Office 365
    MySQL Database on Azure 参数设置
    MySQL Database on Azure 的用户名
    Android NOTE
    从源码看Android中sqlite是怎么通过cursorwindow读DB的
    一个由proguard与fastJson引起的血案
    【转载】淘宝架构框架发展史
  • 原文地址:https://www.cnblogs.com/water-full/p/4485010.html
Copyright © 2011-2022 走看看