hdu2594 Simpsons’ Hidden Talents(KMP,前后缀)
2014-03-19 21:29
567 查看
Simpsons’ Hidden Talents
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2432 Accepted Submission(s): 917
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
#include<stdio.h> #include<string.h> char s[50004],t[50004]; int next[50004],c[50004]; void get_nextval(int len) { int i=0,k=-1; next[0]=-1; while(i<len) if(k==-1||t[i]==t[k]) { ++i; ++k; if(t[i]!=t[k]) next[i]=k; else next[i]=next[k]; } else k=next[k]; } void f(int lt,int ls) { get_nextval(lt); int i=0,j=0; c[0]=0; while(i<ls) { if(j==-1||s[i]==t[j]) { i++;j++; c[i]=j; } else j=next[j]; } } int main() { while(scanf("%s%s",t,s)!=EOF) { int lt=strlen(t),ls=strlen(s); f(lt,ls); if(!c[ls]) printf("0\n"); else { for(int j=0;j<c[ls];j++) printf("%c",t[j]); printf(" %d\n",c[ls]); } } return 0; }
相关文章推荐
- throws和try/catch的区别与联系
- hdu1686 Oulipo(KMP)
- hdu2087 剪花布条(KMP)
- applicationContext.xml
- 安装PLSQL
- java socket编程
- applicationContext.xml
- 二进制数,错位相乘
- debug(fmt,args...)调试
- PyQt4之对话框示例
- 深入理解Java Class文件格式(二)
- hdu1711 Number Sequence(KMP)
- 集合上的动态规划—最优配对问题
- KMP字符串模式匹配详解
- struts.xml
- HDU 1076An Easy Task
- LeetCode Pascal's Triangle
- struts.xml
- DOM删除某个元素
- irectory_list cannot be resolved or is not a field问题的解决办法