hdu 2594 kmp水题 求s1的前缀和s2的后缀重复度的最大值
来源:互联网 发布:中兴编程挑战赛 编辑:程序博客网 时间:2024/06/05 09:30
Simpsons’ Hidden Talents
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1588 Accepted Submission(s): 587
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
Source
HDU 2010-05 Programming Contest
Recommend
lcy
飞机票:http://acm.hdu.edu.cn/showproblem.php?pid=2594
题意: 输入 s1 s2 问s1的后缀 以及s2的前缀中 相同的字符最多有多少个 是什么
思路: kmp
#include<stdio.h>#include<string.h>char s1[51111],s2[51111];int next[51111];int d1,d2;void getnext(){int i=1,j=0;next[1]=0;while(i<=d1){if(j==0||s1[i]==s1[j]) {i++;j++;next[i]=j;}else j=next[j];}}int kmp(){int i,j;i=1;j=1;while(i<=d2){if(j==0||s2[i]==s1[j]) {i++;j++;}//不用担心这里j会超出其最大长度d2 因为当j==d2+1的时候 就会进入j=next[j]返回前面去了//因为s1[d2+1]是没有值的不会等于对应位置的s2中的值 会返回到前面去else j=next[j];}return j-1;}int main(){int k; while(scanf("%s",s1+1)!=EOF){scanf("%s",s2+1);d1=strlen(s1+1);d2=strlen(s2+1);//s2做主串getnext();k=kmp();if(k==0) printf("0\n");elseprintf("%s %d\n",s2+1+d2-k,k);}return 0;}
- hdu 2594 kmp水题 求s1的前缀和s2的后缀重复度的最大值
- hdu_2594_求串s1的前缀和串s2后缀最大相同部分
- HDU 2594 Simpsons’ Hidden Talents(s1的前缀是s2的后缀)
- kmp求前缀和后缀的最大重复部分
- hdu 2594 Simpsons’ Hidden Talents (KMP求第一串前缀和第二串后缀最大值)
- 转帖-POJ 2774 后缀数组 题目要求:求s1,s2的最大子串
- char *s1和char s2[]的区别
- 求最长公共前缀和后缀—基于KMP的next数组
- hdu4552怪盗基德的挑战书&hdu3336Count the string【后缀数组求各前缀重复次数和】
- MySQL填充字符串的函数LPAD(s1,len,s2)和RPAD(s1,len,s2)
- 给定s1,s2,s3,发现是否通过s1和s2的交错形成s3。
- hdoj 2594 Simpsons’ Hidden Talents 【KMP】【求串的最长公共前缀后缀】
- Hdu 4552 怪盗基德的挑战书 (所有前缀出现次数和 后缀数组或KMP)
- 字符串匹配的KMP算法--前缀和后缀的详解
- char s1[]和char * s2的三点区别!!!
- char *s1 = "***"和char s2[]="***"的区别
- hdu 3336Count the string(KMP变形,求前缀出现的次数和)
- 【Kmp求字符串前缀在字符串出现的次数】51nod 1277 字符串中的最大值
- Java中的ThreadLocal类
- 最小步数 结题报告
- OpenCV库基础知识
- 深入浅出Symfony2 - 结合MongoDB开发LBS应用
- js在frame中操作frameset的cols属性的改变
- hdu 2594 kmp水题 求s1的前缀和s2的后缀重复度的最大值
- .NET平台将最具性价比
- C#基础篇2(问答)
- 4款好用的Android设备HTML编辑器
- Nutch源代码研究 网页抓取 下载插件
- word 目录里面添加分节符下一页出现空白页的解决方法
- iphone jabber XMPP im
- IOS下载资源zip到本地然后读取
- Android UI控件二