hdu 3374 String Problem （kmp+最大最小表示法）

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 using namespace std;
 5 int next[1000010],len,t;
 6 char ch[1000010];
 7 
 8 void get_next()
 9 {
10     int i=0,j=-1;
11     next[0]=-1;
12     while (i<len)
13     {
14         if (j==-1||ch[i]==ch[j])
15         {
16             i++;
17             j++;
18             next[i]=j;
19         }
20         else
21             j=next[j];
22     }
23 }
24 
25 int Min_(char s[],int len)
26 {
27     int p1=0,p2=1,k=0;
28     while (p1<len&&p2<len&&k<len)
29     {
30         t=s[(p1+k)%len]-s[(p2+k)%len];
31         if (t==0)
32             k++;
33         else
34         {
35             if (t>0)
36                 p1=p1+k+1;
37             else
38                 p2=p2+k+1;
39             if (p1==p2)
40                 p2++;
41             k=0;
42         }
43     }
44     return min(p1,p2);
45 }
46 
47 int Max_(char s[],int len)
48 {
49     int p1=0,p2=1,k=0;
50     while (p1<len&&p2<len&&k<len)
51     {
52         t=s[(p1+k)%len]-s[(p2+k)%len];
53         if (t==0)
54             k++;
55         else
56         {
57             if (t>0)
58                 p2=p2+k+1;
59             else
60                 p1=p1+k+1;
61             if (p1==p2)
62                 p2++;
63             k=0;
64 
65         }
66     }
67     return p1<p2?p1:p2;
68 }
69 
70 int main()
71 {
72     while(~scanf("%s",ch))
73     {
74         len=strlen(ch);
75         get_next();
76         int Max=Max_(ch,len);
77         int Min=Min_(ch,len);
78         //cout<<Max<<Min<<endl;
79         int sum=0;
80         if(len%(len-next[len])==0)
81             sum=len/(len-next[len]);
82         else
83             sum=1;
84         printf ("%d %d %d %d\n",Min+1,sum,Max+1,sum);
85     }
86     return 0;
87 }