ACM-FZOJ1011解题报告

新浪博客 发表时间 --2009-07-28 21:19:38

Power Strings

<wbr><wbr>这道题题目意思很明显，要让我们求最长重复字符串，刚好，老师讲了KMP算法，想想也应该是用KMP算法来解决，但也找不到好的解决办法...</wbr></wbr>

<wbr><wbr>上网查了下，发现了别人的一个思想，就是题目要找最长重复字符串，我们先用字符串长度减去找到的位置，然后用字符串长度来判断是否能整除于它，行的话结果就等于字符串长度除于它，否则就赋值为1...</wbr></wbr>

代码：

<wbr>#include "iostream"<br> #include "string.h"<br> using namespace std;<br> int Getnextval(char str[],int nextval[])<br> {<br><wbr>int j=0,k=-1,d;<br><wbr>d=strlen(str);<br><wbr>nextval[0]=-1;<br><wbr>while (j&lt;d)<br><wbr>{<br><wbr><wbr>if (k==-1||str[j]==str[k])<br><wbr><wbr>{<br><wbr><wbr><wbr>j++;<br><wbr><wbr><wbr>k++;<br><wbr><wbr><wbr>if (str[j]!=str[k])<br><wbr><wbr><wbr>{<br><wbr><wbr><wbr><wbr>nextval[j]=k;<br><wbr><wbr><wbr>}<br><wbr><wbr><wbr>else<br><wbr><wbr><wbr><wbr>nextval[j]=nextval[k];<br><wbr><wbr>}<br><wbr><wbr>else<br><wbr><wbr><wbr>k=nextval[k];<br><wbr>}<br><wbr>j-=k;<br><wbr>return j;<br> }<br> int main()<br> {<br><wbr>char str[1000001];<br><wbr>int a[1000000],d,h,i,max;<br><wbr>while (1)<br><wbr>{<wbr><wbr><br><wbr><wbr>gets(str);<br><wbr><wbr>if (str[0]=='.'&amp;&amp;str[1]=='\0')<br><wbr><wbr>{<br><wbr><wbr><wbr>break;<br><wbr><wbr>}<br><wbr><wbr>d=strlen(str);<br><wbr><wbr>h=Getnextval(str,a);<br><wbr><wbr>if (d%h==0)<br><wbr><wbr>{<br><wbr><wbr><wbr>h=d/h;<br><wbr><wbr>}<br><wbr><wbr>else<br><wbr><wbr><wbr>h=1;<br><wbr><wbr>printf("%d\n",h);<br><wbr>}<br><wbr>return 0;<br> }</wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr>