hdu 1358 KMP next数组的运用

 1 #include<iostream>
 2 #include<string>
 3 #include<string.h>
 4 #define MAX_N 1000005
 5 
 6 using namespace std;
 7 
 8 int len;
 9 string s;
10 int nexxt[MAX_N];
11 
12 void getNext()
13 {
14     nexxt[0]=-1;
15     int i = 0,j=-1;
16     while(i<=len)
17     {
18         if(j==-1 || s[i]==s[j])
19         {
20             i++,j++;
21             nexxt[i]=j;
22         }
23         else
24             j=nexxt[j];
25     }
26 }
27 int main()
28 {
29     int con = 1;
30     while(cin>>len,len)
31     {
32         cin>>s;
33         printf("Test case #%d\n",con++);
34         getNext();
35         for(int i = 1; i <= len; i++)
36         {
37             if(i%(i-nexxt[i])==0 && i/(i-nexxt[i])>1)
38                 cout<<i<<‘ ‘<<i/(i-nexxt[i])<<endl;
39         }
40         cout<<endl;
41     }
42     return 0;
43 }