zoukankan      html  css  js  c++  java
  • POJ3974

    Andy the smart computer science student was attending an algorithms class
    when the professor asked the students a simple question, "Can you propose
    anefficient 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 <string.h>
    #include <stdio.h>
    #include <math.h>
    #include <algorithm>
    using namespace std;
    const int maxn=2e6+10;
    char ss[maxn<<1],c[maxn];
    int p[maxn<<1],len;
    void manacher(char s[],int l)
    {
    	 len=0;
    	 int i,j;
    	ss[len++]='$',ss[len++]='#';
    	for (i=0;i<l;i++)
    	{
    		ss[len++]=s[i];
    		ss[len++]='#';
    	}
    	
    	int mx=0,C=0;
    	int ans=0;
    	for (i=1;i<len;i++)
    	{
    		if (mx>i)
    		p[i]=min(mx-i,p[2*C-i]);
    		else
    		p[i]=0;
    		while(ss[i+p[i]]==ss[i-p[i]])
    		{
    			p[i]++;
    		}
    		if (i+p[i]>mx)
    		{
    			mx=i+p[i];
    			C=i;
    		}
    	}
    }
    int main()
    {
    	int i,j,n;
    	int flag=0;
    	while(~scanf("%s",c)&&strcmp(c,"END")!=0)
    	{
    		flag++;
    		printf("Case %d: ",flag);
    		manacher(c,strlen(c));	
    		int maxx=-1;
    		for (i=1;i<len;i++)
    			maxx=max(maxx,p[i]);
    		printf("%d
    ",maxx-1);
    	}
    	return 0;
    }
  • 相关阅读:
    【转载】Myeclipse如何自动创建hibernate
    win7 64位mysql安装及navicat 解压版
    NuGet套件还原步骤(以vs2012为例)
    Html.DropDownListFor() 二级联动 ($.getJSON)
    ModelState验证部分属性
    asp.net mvc发送邮件
    SpringBoot的热部署
    SpringBoot 入门demo
    集群、负载均衡、微服务、分布式的概念
    SpringBoot 简介
  • 原文地址:https://www.cnblogs.com/shidianshixuan/p/14321659.html
Copyright © 2011-2022 走看看