HDU -2594 Simpsons’ Hidden Talents（KMP）

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

题意：匹配串的某一前缀是模板串的后缀，输出这个前缀和长度

KMP真神奇

#include <stdio.h>
#include <string.h>

const int N=1e6;
char s[N+5], p[N+5];//匹配串，模板串
int nxt[N+5];
int slen, plen;//匹配串的长度，模板串的长度

void getNext(char s[], int slen)//匹配串s的失配数组
{
    int i=0,j=-1;
    nxt[0]=-1;
    while(i<slen)
    {
        if(j==-1||s[i]==s[j])
            nxt[++i]=++j;
        else
            j=nxt[j];
    }
}

int KMP(int slen, int plen)//返回匹配串第一个数在模板串中的位置
{
    getNext(s, slen);
    int i=0,j=0;
    while(i<plen)
    {
        if(j==-1||p[i]==s[j])
            ++i,++j;
        else
            j=nxt[j];
    }
    return j;
}

int main()
{
    while(scanf("%s", s)!=EOF)
    {
        scanf("%s", p);
        slen=strlen(s);
        plen=strlen(p);
        int n=KMP(slen, plen);
        for(int i=0; i<n; i++)
            printf("%c", s[i]);
        if(n)
            printf(" ");
        printf("%d\n", n);
    }
    return 0;
}