HDU 2594 Simpsons’ Hidden Talents
来源:互联网 发布:淘宝客微信群被限制 编辑:程序博客网 时间:2024/05/01 00:30
Simpsons’ Hidden Talents
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10282 Accepted Submission(s): 3581
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的next数组求值,最后判断两串的长度不等时间的特殊情况。代码:#include<stdio.h>#include<string.h>#include<ctype.h>int lena,lenb;char a[50010],b[50010],c[100010];int next[100010];void get_(){ int i,j; i=1;j=0; while(i<lena+lenb) { if(j==0&&c[i]!=c[j]) { next[i]=0; i++; } else if(j>0&&c[i]!=c[j]) { j=next[j-1]; } else { next[i]=j+1; i++; j++; } } int x; x=next[lena+lenb-1]; if(x==0) printf("0\n"); else { a[x]='\0'; if(lenb>lena) { if(x>lena) printf("%s %d\n",a,lena); else printf("%s %d\n",a,x); } else { if(x>lenb) printf("%s %d\n",b,lenb); else printf("%s %d\n",a,x); } }}int main(){ while(scanf("%s%s",a,b)!=EOF) { memset(next,0,sizeof(next)); lena=strlen(a); lenb=strlen(b); strcpy(c,a); strcat(c,b); get_(); } return 0;}
阅读全文
0 0
- hdu 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- HDU 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- HDU 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- HDU - 2594 Simpsons’ Hidden Talents
- HDU 2594 Simpsons’ Hidden Talents
- HDU 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- HDU 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- 007 总结:极限三种情况及性质(唯一性、有界性、保号性);无穷小及无穷大
- 源码圈 300 胖友的书单整理
- java 反编译 知识学习汇总 java网络爬取网页代码
- 1233: [Usaco2009Open]干草堆tower
- Python花式编程案例集锦(5)
- HDU 2594 Simpsons’ Hidden Talents
- DELL笔记本关闭功能键(WIN10)
- POJ刷题注意事项
- [BZOJ1072][SCOI2007]排列perm(状压dp)
- 《C和指针》读书笔记(五)
- static和const关键字
- 《C和指针》读书笔记(六)
- 《C和指针》读书笔记(七)
- Spring MVC源码分析—基于Java中Socket实现HTTP协议