zoukankan      html  css  js  c++  java
  • 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~
  • 相关阅读:
    抖音圈圈乐 系统搭建H5微信小游戏圈圈乐系统介绍
    GPS NMEA-0183标准详解
    GPS定位的偏移校正(WGS84与火星坐标互转)
    Complete_NGINX_Cookbook
    GBT32960-2016电动汽车远程服务与管理系统技术规范 第3部分:通信协议及数据格式
    Redis 到底是怎么实现“附近的人”这个功能的呢?
    NETGEAR R7800路由器TFTP刷回原厂固件方法
    JT/T 808-2013 道路运输车辆卫星定位系统北斗兼容车载终端通讯协议技术规范
    如何正确地使用设计模式?
    各常用分类算法的优缺点总结:DT/ANN/KNN/SVM/GA/Bayes/Adaboosting/Rocchio
  • 原文地址:https://www.cnblogs.com/Archger/p/8451578.html
Copyright © 2011-2022 走看看