HDU 2594 Simpsons’ Hidden Talents (kmp)
来源:互联网 发布:苹果手机微信数据恢复 编辑:程序博客网 时间:2024/05/16 15:41
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2594
Simpsons’ Hidden Talents
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6451 Accepted Submission(s): 2321
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.
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.
The lengths of s1 and s2 will be at most 50000.
Sample Input
clintonhomerriemannmarjorie
Sample Output
0rie 3
思路:kmp
#include <stdio.h>#include <string.h>#include <iostream>using namespace std;int ne[50010];char st1[50010],st2[50010];void getnex(char s[],int m){ int k = -1,j = 0; ne[0] = -1; while (j < m ) { if (k == -1 || s[j] == s[k]) { ++k; ++j; ne[j] = k; } else { k = ne[k]; } }}int main(){ while (cin >> st1 >> st2) { int len1 = strlen(st1); getnex(st1,len1); int len2 = strlen(st2); int j = 0,i = 0; if ( len2 > len1 ) { i = len2 - len1; } while ( i < len2 && j < len1) { if ( j == -1 || st1[j] == st2[i]) { i++; j++; } else { j = ne[j]; } } if ( j == 0 || j == -1) { printf("0\n"); } else { for (int i = 0 ; i < j; i++ ) { printf("%c",st1[i]); } printf(" %d\n",j); } } return 0;}
0 0
- HDU 2594 Simpsons’ Hidden Talents(KMP)
- hdu 2594 Simpsons’ Hidden Talents(KMP)
- HDU 2594 Simpsons’ Hidden Talents (KMP)
- HDU 2594 Simpsons’ Hidden Talents(kmp)
- HDU 2594 Simpsons' Hidden Talents(kmp)
- HDU 2594 Simpsons’ Hidden Talents (kmp)
- HDU 2594 Simpsons’ Hidden Talents(KMP)
- HDU 2594 Simpsons’Hidden Talents(KMP)
- hdu 2594 Simpsons’ Hidden Talents(KMP)
- HDU 2594 Simpsons’ Hidden Talents (kmp)
- HDU 2594 Simpsons’ Hidden Talents(kmp)
- HDU-2594 Simpsons’ Hidden Talents(KMP)
- 【hdu 2594】Simpsons’ Hidden Talents(kmp)
- hdu 2594 Simpsons' Hidden Talents(KMP)
- HDU 2594 Simpsons’ Hidden Talents(KMP)
- KMP hdu-2594 Simpsons’ Hidden Talents
- HDU 2594 Simpsons’ Hidden Talents KMP
- HDU 2594Simpsons’ Hidden Talents(KMP运用)
- CentOS 7环境Linux服务器搭建记录
- 测试
- 调整数组顺序使奇数位于偶数前面
- 用C语言查询某个人的投票数
- [算法学习笔记]线性时间排序----计数排序
- HDU 2594 Simpsons’ Hidden Talents (kmp)
- 随笔2
- 线程 —— 使用匿名内部类的方式启动线程
- Android自定义Animation实现3D翻转按钮
- 【算法学习】POJ3070——利用分治法来计算Fibonacci数列的值
- HDU1166 敌兵布阵[线段树/树状数组]
- 通过迭代器来获得对应元素的下标╮(╯▽╰)╭ ~
- centos6.x常用命令
- POJ-2585 Window Pains