zoukankan      html  css  js  c++  java
  • Palindrome(Manacher)

    Palindrome
    Time Limit: 15000MS   Memory Limit: 65536K
    Total Submissions: 6183   Accepted: 2270

    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
    manacher;
    代码:
     1 #include<iostream>
     2 #include<algorithm>
     3 #include<cstdio>
     4 #include<cstring>
     5 #include<cmath>
     6 #include<vector>
     7 #define mem(x,y) memset(x,y,sizeof(x))
     8 using namespace std;
     9 typedef long long LL;
    10 const int INF=0x3f3f3f3f;
    11 const int MAXN=1000010;
    12 char str[MAXN],s[MAXN<<1];
    13 int p[MAXN<<1];
    14 int Manacher(char *s,int len){
    15     p[0]=p[1]=1;
    16     int ans=0,id=1,mx=1;
    17     for(int i=2;i<len;i++){
    18         if(mx>i)p[i]=min(p[2*id-i],mx-i);
    19         else p[i]=1;
    20         while(s[i-p[i]]==s[i+p[i]])p[i]++;
    21         if(p[i]+i>mx)mx=p[i]+i,id=i;
    22         ans=max(ans,p[i]-1);
    23     }
    24     return ans;
    25 }
    26 int main(){
    27     int flot=0;
    28     while(~scanf("%s",str),strcmp(str,"END")){
    29         int len=strlen(str);
    30         s[0]='@';
    31         for(int i=0;i<len;i++){
    32             s[2*i+1]='#';
    33             s[2*i+2]=str[i];
    34         }
    35         s[2*len+1]='#';
    36         printf("Case %d: %d
    ",++flot,Manacher(s,2*len+2));
    37     }
    38     return 0;
    39 }
  • 相关阅读:
    DiskFileUpload上传与Spring的CommonsMultipartResolver上传对比
    ajax请求jesery接口无法获取参数的问题解决方案
    java乱码问题总结
    indiGolog的安装
    hadoop启动步骤
    ubuntu修改默认jdk
    ubuntu 安装 ssh
    rabbitmq五种模式详解(含实现代码)
    终于可以像使用 Docker 一样丝滑地使用 Containerd 了
    Docker安装Nacos动态服务发现、配置和服务管理平台
  • 原文地址:https://www.cnblogs.com/handsomecui/p/4909103.html
Copyright © 2011-2022 走看看