KMP的next数组性质运用
2014-04-08 18:06
295 查看
hdu2594
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2525 Accepted Submission(s): 960
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
Sample Output
分析:
next[j]=k:下标为j的前k个字符和开头的前k个字符完全一样
对于字符串abcuijkabc的长度为10,即next[10]=3;
所以这道题可以先把两个字符串合并,用next数组的性质可以更高效的求出;
注意:
aaaa和aaa答案是aaaaaa 6不符合题意
在合并的时候在两个字符串之间加上一个特殊字符如“#”
即新字符串为aaaa#aaa,此时的答案为 aaa 3
程序:
Simpsons’ Hidden Talents
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2525 Accepted Submission(s): 960
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
分析:
next[j]=k:下标为j的前k个字符和开头的前k个字符完全一样
对于字符串abcuijkabc的长度为10,即next[10]=3;
所以这道题可以先把两个字符串合并,用next数组的性质可以更高效的求出;
注意:
aaaa和aaa答案是aaaaaa 6不符合题意
在合并的时候在两个字符串之间加上一个特殊字符如“#”
即新字符串为aaaa#aaa,此时的答案为 aaa 3
程序:
#include"stdio.h" #include"string.h" #define M 100009 int next[M]; void getNext(char *b) { int i,j; i=0; j=-1; next[0]=-1; while(b[i]!='\0') { if(j==-1||b[i]==b[j]) { i++; j++; next[i]=j; } else j=next[j]; } } char ch[M],ch1[M]; int main() { while(scanf("%s%s",ch,ch1)!=EOF) { char str[M]; strcat(ch,"0"); strcat(ch,ch1); int m=strlen(ch); getNext(ch); strncpy(str,ch,next[m]); str[next[m]]='\0';//注意 if(next[m]) printf("%s %d\n",str,next[m]); else printf("0\n"); } }
相关文章推荐
- KMP的next数组性质运用
- poj 2752 KMP(next数组的运用)
- HDOJ 1358 Period(KMP next数组运用)
- KMPnext数组运用、最小循环节问题
- kmp中next数组的运用
- POJ2752_通过kmpNext数组的性质求一个字符串的公共同前后缀
- KMP (next数组的性质及证明)
- KMP及其next数组性质学习小记 Poj1961 Period
- hdu 3746 Cyclic Nacklace(KMP中next数组的运用)
- HDU 3374 String Problem(最大最小表示法模板+KMP+next数组的运用)
- Period(kmp中next数组的运用)
- Count the string---hdu3336(kmp Next数组的运用)
- kmp的next数组的运用(求字符串的最小循环节)
- POJ 2752-Seek the Name, Seek the Fame(KMP的next数组运用)
- kmp的next数组的运用(求字符串的最小循环节)
- hdu1358(KMP,next数组性质)
- HDU 1358(KMP:next数组性质)
- Count the string (kmp的next数组运用)
- POJ 2752 Seek the Name, Seek the Fame(KMP next数组运用)
- HDU 3336 Count the string (KMP next数组运用——统计前缀出现次数)