• POJ 3974 Palindrome【manacher】【模板题】【模板】


    Palindrome
    Time Limit: 15000MS   Memory Limit: 65536K
    Total Submissions: 9838   Accepted: 3724

    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

    Source

    #include <iostream>
    #include <algorithm>
    #include <cmath>
    #include <cstdio>
    #include <string>
    #include <cstring>
    #include <map>
    #include <set>
    #include <queue>
    #include <stack>
    #define INF 0x3f3f3f3f
    #define ms(x,y) memset(x,y,sizeof(x))
    using namespace std;
    
    typedef long long ll;
    
    const double pi = acos(-1.0);
    const int mod = 1e9 + 7;
    const int maxn = 1000010;
    
    char s[maxn];
    
    int len[maxn<<1];	//注意要开2倍大小
    
    int manacher(char str[], int len[], int n)
    {
    	len[0] = 1;
    	int i, j, p, q, r;
    	for (i = 1, j = 0; i < (n << 1) - 1; ++i) {
    		p = i >> 1; q = i - p; r = ((j + 1) >> 1) + len[j] - 1;
    		len[i] = r < q ? 0 : min(r - q + 1, len[(j << 1) - i]);
    		while (p > len[i] - 1 && q + len[i] < n && str[p - len[i]] == str[q + len[i]])
    			++len[i];
    		if (q + len[i] - 1 > r) j = i;
    	}
    	int ret = 0, tmp;
    	for (i = 0; i < (n << 1) - 1; ++i) {
    		if (i & 1) tmp = len[i] << 1;
    		else tmp = (len[i] << 1) - 1;
    		if (tmp > ret) ret = tmp;
    	}
    	return ret;
    }
    
    int main()
    {
    	//freopen("in.txt","r",stdin);
    	//freopen("out.txt","w",stdout);
    	int t, cas = 0, ans;
    	scanf("%d", &t);
    	while (t--)
    	{
    		ms(s, 0);
    		scanf(" %s", s);
    		if (strcmp(s, "END") == 0) break;
    		ans = manacher(s, len, strlen(s));
    		printf("Case %d: %d
    ", ++cas, ans);
    	}
    	return 0;
    }	








    Fighting~
  • 相关阅读:
    《转》 在C++中使用TinyXML2解析xml
    基于多种转换语义的图数据库查询
    tomcat内存、连接数优化
    JAVA基础针对自己薄弱环节总结01(循环之前的知识)
    CodeForces
    N年的经验在别人眼里是怎么看的?
    perl install-module.pl DateTime 执行无效问题的解决
    在Linux上使用iptables命令开启对外访问的网络端口
    Linux上安装Bugzilla4.4小记
    在Lotus Notes设置邮件转发
  • 原文地址:https://www.cnblogs.com/Archger/p/8451578.html
Copyright © 2020-2023  润新知