Simpsons’ Hidden Talents—

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数组的理解，具体没什么难点，主要是在两个字符串连接时候需要加一个其他字符，否则next计算时有可能会出现最长公共前后缀合并起来刚好变长的情况。

#include <iostream>
#include <cstdio>
#include <string.h>
using namespace std;
int Next[100000];
void getnext(int next[], const string str)
{int m = str.length();int j = 0, k = -1;next[0] = -1;while (j < m){if (k == -1 || str[j] == str[k]){j++;k++;next[j] = k;}elsek = next[k];}
}
int main()
{string s1;string s2;memset(Next, 0, sizeof(Next));while (cin >> s1){cin >> s2;s1 = s1 + "#" + s2;getnext(Next, s1);if (Next[s1.length()] == 0)cout << Next[s1.length()] << endl;else{for (int i = 0; i < Next[s1.length()]; i++)cout << s1[i];cout << " " << Next[s1.length()] << endl;}}return 0;
}

Simpsons’ Hidden Talents——kmp入门相关推荐

Simpsons’ Hidden Talents(KMP ，两个串的前后缀匹配)
Simpsons' Hidden Talents 题目给两个串,求S1的前缀和S2的后缀的最大匹配思路拼接两个串,处理出nxt数组,nxt[k] 即为所求,因为它们的最大匹配不能超过原串的长度, ...
HDU 2594 - Simpsons’ Hidden Talents(KMP）
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=2594 题目描述: 给定两个字符串s1,s2,问是否存在一个最长的子串,使得这个子串既是s1的前缀又是 ...
HDU - 2594 Simpsons’ Hidden Talents(KMP的next数组)
题目链接:点击查看题目大意:给出两个字符串s1和s2,求出s1的前缀和s2的后缀可以匹配的最大长度,并输出其匹配的子字符串题目分析:因为涉及到了前后缀的关系,我想的是可以将s1和s2连接成一个字符 ...
HDU 2594 Simpsons’ Hidden Talents （字符串-KMP）
Simpsons' Hidden Talents Problem Description Homer: Marge, I just figured out a way to discover some ...
kmp总结(相关例题1. Simpsons’ Hidden Talents 2.Oulipo）
kmp相关及相关例题文章目录 kmp相关及相关例题一.kmp算法最常规使用方法二.相关例题 1. Simpsons' Hidden Talents 2.Oulipo 一.kmp算法最常规使用方法 ...
Simpsons’ Hidden Talents（辛普森一家的隐藏天赋）(kmp经典模板题) HDU - 2594
题目:Simpsons' Hidden Talents(辛普森一家的隐藏天赋 ) 中文大意 Homer: Marge, I just figured out a way to discover som ...
HDU2594(Simpsons’ Hidden Talents)
Simpsons' Hidden Talents Problem Description Homer: Marge, I just figured out a way to discover some ...
B - Simpsons’ Hidden Talents
B - Simpsons' Hidden Talents Homer: Marge, I just figured out a way to discover some of the talents ...
HDU-2594 Simpsons’ Hidden Talents
HDU-2594 Simpsons' Hidden Talents 题目链接:HDU-2594 题目大意:给定两个字符串问第一个字符串前缀与第二个字符串的后缀的最大的重复部分有多长不为0的话将他们 ...

Simpsons’ Hidden Talents——kmp入门

Simpsons’ Hidden Talents——kmp入门相关推荐

最新文章

热门文章