zoukankan      html  css  js  c++  java
  • hdoj_2594Simpsons’ Hidden Talents

    Simpsons’ Hidden Talents

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 1599    Accepted Submission(s): 589


    Problem Description
    Homer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had.
    Marge: Yeah, what is it?
    Homer: Take me for example. I want to find out if I have a talent in politics, OK?
    Marge: OK.
    Homer: So I take some politician’s name, say Clinton, and try to find the length of the longest prefix
    in Clinton’s name that is a suffix in my name. That’s how close I am to being a politician like Clinton
    Marge: Why on earth choose the longest prefix that is a suffix???
    Homer: Well, our talents are deeply hidden within ourselves, Marge.
    Marge: So how close are you?
    Homer: 0!
    Marge: I’m not surprised.
    Homer: But you know, you must have some real math talent hidden deep in you.
    Marge: How come?
    Homer: Riemann and Marjorie gives 3!!!
    Marge: Who the heck is Riemann?
    Homer: Never mind.
    Write a program that, when given strings s1 and s2, finds the longest prefix of s1 that is a suffix of s2.
     

    Input
    Input consists of two lines. The first line contains s1 and the second line contains s2. You may assume all letters are in lowercase.
     

    Output
    Output consists of a single line that contains the longest string that is a prefix of s1 and a suffix of s2, followed by the length of that prefix. If the longest such string is the empty string, then the output should be 0.
    The lengths of s1 and s2 will be at most 50000.
     

    Sample Input
    clinton homer riemann marjorie
     

    Sample Output
    0 rie 3
    利用next数组的性质,以Text[i]结尾的j个字符恰好与pat数组的前j个字符匹配

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<map>
    #include<cmath>
    #include<vector>
    #include<algorithm>
    #include<set>
    #include<string>
    #include<queue>
    #include <stack>
    using namespace std;
    #pragma warning(disable : 4996)
    const int MAXN = 50005 * 2;
    int Next[MAXN];
    char text[MAXN], pat[MAXN];
    void get_next()
    {
    	int i = 0, j = -1;
    	int lenp = strlen(pat);
    	Next[0] = -1;
    	while(i < lenp)
    	{
    		if(j == -1 || pat[i] == pat[j])
    		{
    			i++;
    			j++;
    			Next[i] = j;
    		}
    		else
    		{
    			j = Next[j];
    		}
    	}
    }
    
    int main()
    {
    	freopen("in.txt", "r", stdin);
    	int lenp, len;
    	while (scanf("%s %s", pat, text) != EOF)
    	{
    		len = min(strlen(pat), strlen(text));
    		memset(Next, 0, sizeof(Next));
    		strcat(pat, text);
    		lenp = strlen(pat);
    		get_next();
    		if(Next[lenp] >= len)
    		{
    			for(int i = 0; i < len; i++)
    			{
    				printf("%c", pat[i]);
    			}
    			printf(" %d\n", len);
    		}
    		else if(Next[lenp] != 0)
    		{
    			for(int i = 0; i < Next[lenp]; i++)
    			{
    				printf("%c", pat[i]);
    			}
    			printf(" %d\n", Next[lenp]);
    		}
    		else
    		{
    			printf("0\n");
    		}
    		
    	}
    	return 0;
    }

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<map>
    #include<cmath>
    #include<vector>
    #include<algorithm>
    #include<set>
    #include<string>
    #include<queue>
    #include <stack>
    using namespace std;
    #pragma warning(disable : 4996)
    const int MAXN = 50005;
    int Next[MAXN];
    int ans[MAXN];
    char text[MAXN], pat[MAXN];
    void get_next()
    {
    	int i = 0, j = -1;
    	int length = strlen(pat);
    	Next[0] = -1;
    	while(i < length)
    	{
    		if(j == -1 || pat[i] == pat[j])
    		{
    			i++;
    			j++;
    			Next[i] = j;
    		}
    		else
    		{
    			j = Next[j];
    		}
    	}
    }
    void kmp()
    {
    	int lent = strlen(text);
    	int lenp = strlen(pat);
    	get_next();
    	int i = 0, j = 0;
    	ans[0] = 0;
    	while(i < lent)
    	{
    		if(j == -1 || text[i] == pat[j])
    		{
    			i++;
    			j++;
    			ans[i] = j;
    		}
    		else
    		{
    			j = Next[j];
    		}
    	}
    }
    
    int main()
    {
    	freopen("in.txt", "r", stdin);
    	while (scanf("%s %s", pat, text) != EOF)
    	{
    		int len = strlen(text);
    		kmp();	
    		if(ans[len] == 0)
    		{
    			printf("0\n");
    		}
    		else
    		{
    			for (int i = 0; i < ans[len]; i++)
    			{
    				printf("%c", pat[i]);
    			}
    			printf(" %d\n", ans[len]);
    		}
    
    	}
    	return 0;
    }



  • 相关阅读:
    JavaScript 检测对象类型
    memorize
    高阶函数
    JavaScript 中的不完全函数
    VS C# Winform 重写进度条
    使用ECLIPSE+RED搭建RF自动化测试框架
    NOIP2018濒死记
    HDU 5977 Garden of Eden (树形dp+快速沃尔什变换FWT)
    打FFT时中发现的卡常技巧
    Dynamic Rankings || 动态/静态区间第k小(主席树)
  • 原文地址:https://www.cnblogs.com/lgh1992314/p/5834974.html
Copyright © 2011-2022 走看看