HDU 2594 Simpsons’ Hidden Talents

Simpsons’ Hidden Talents

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

 

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

 

题目大意：

　　　　 每次输入两个字符串s1，s2 然后找到一个字符串使他满足既是s1的前缀又是s2的后缀   如果能找到输出该字符串及它的长度 否则输出0

 

解题思路：

　　　　KMP算法  找出s1的next数组然后将s2数组跟s1数组进行逐个比较

　　　　对KMP不太熟悉的可以看这里:从头到尾理解KMP算法

 

 

#include <stdio.h>
#include <string.h>
char s1[50050],s2[50050];
int next[50050];
void getnext()
{
    int i = 0,j = -1;
    next[0] = -1;
    int len = strlen(s1);
    while (i < len)
    {
        if (j == -1 || s1[i] == s1[j])
        {
            i ++;
            j ++;
            if (s1[i] == s1[j])
                next[i] = next[j];
            else
                next[i] = j;
        }
        else
            j = next[j];
    }
}
int kmp()
{
    int i = 0,j = 0;
    int len1 = strlen(s1);
    int len2 = strlen(s2);
    while (i < len2)  //特别注意 跟模板有少许的差别
    {
        if (j == -1 || s1[j] == s2[i])
        {
            i ++;
            j ++;
        }
        else
            j = next[j];
    }
    return j;
}
int main()
{
    while (~scanf("%s",s1))
    {
        scanf("%s",s2);
        getnext();
        int len = kmp();
        
        for (int i = 0; i < len; i ++)
            printf("%c",s1[i]);
        if (len)
            printf(" ");
        printf("%d\n",len);
    }
    return 0;
}