POJ 3080 Blue Jeans KMP

题意：找出所有字符串中最长相同字串
解题思路：枚举KMP
解题代码：
  1 // File Name: getnext.cpp
  2 // Author: darkdream
  3 // Created Time: 2014年09月09日 星期二 22时35分02秒
  4 
  5 #include<vector>
  6 #include<list>
  7 #include<map>
  8 #include<set>
  9 #include<deque>
 10 #include<stack>
 11 #include<bitset>
 12 #include<algorithm>
 13 #include<functional>
 14 #include<numeric>
 15 #include<utility>
 16 #include<sstream>
 17 #include<iostream>
 18 #include<iomanip>
 19 #include<cstdio>
 20 #include<cmath>
 21 #include<cstdlib>
 22 #include<cstring>
 23 #include<ctime>
 24 #define LL long long
 25 
 26 using namespace std;
 27 char str1[100];
 28 char str[20][100];
 29 int next[105];
 30 void split(int x ,int y )
 31 {
 32    int t = -1;
 33    for(int i = x ;i <= y ;i ++)
 34    {
 35       str1[++t] =  str[1][i];
 36    }
 37    str1[++t] = '\0';
 38 }
 39 void getnext()
 40 {
 41     int len = strlen(str1);
 42     next[0] = -1; 
 43     int k = -1;
 44     int j = 0 ; 
 45     while(j <= len - 1)
 46     {
 47         if(k == -1 || str1[j] == str1[k])
 48         {
 49             ++j; 
 50             ++k;
 51             next[j] = k ;
 52         }
 53         else {
 54             k = next[k];
 55         }
 56     }
 57 }
 58 int  kmp(int k)
 59 {
 60     int j = 0 ; 
 61     int i = 0 ;
 62     int len = strlen(str1);
 63 
 64     while(j < 60)
 65     {
 66        if(i == -1 || str1[i] == str[k][j])
 67        {
 68          i ++ ; 
 69          j ++ ; 
 70        }else{
 71          i = next[i];
 72        }
 73        if(i == len)
 74        {
 75           return 1; 
 76        }
 77     }
 78     return 0 ;
 79 }
 80 int n ;
 81 char ans[100];
 82 int maxlen; 
 83 int  solve(int x, int y)
 84 {
 85     split(x,y);
 86 //    puts(str1);
 87     getnext();
 88     for(int i = 2 ;i <= n;i ++)
 89     {
 90       if(!kmp(i))
 91       {
 92          return 0 ;  
 93       }
 94     }
 95     //puts(str1);
 96     if(y - x + 1 > maxlen)
 97     {
 98          strcpy(ans,str1);
 99          maxlen = y-x +1; 
100     }
101     else if(y -x +1 == maxlen)
102     {
103        if(strcmp(ans,str1) > 0)
104            strcpy(ans,str1);
105     }
106     return 1;
107 }
108 int main(){
109     int t ;
110     scanf("%d",&t);
111     while(t--)
112     {
113       scanf("%d",&n);
114       maxlen = 0 ; 
115       for(int i = 1 ;i <= n;i ++)
116       {
117         scanf("%s",str[i]);
118       }
119       for(int i = 0 ;i < 60 ;i ++)
120         for(int j = i;j < 60 ;j ++)
121         {
122           if(!solve(i,j))
123           {
124              break;
125           }
126         }
127      if(maxlen >= 3)
128       {
129         puts(ans);
130       }else {
131         printf("no significant commonalities\n");
132       }
133     }
134     return 0;
135 }
View Code
posted on 2014-09-10 11:55 dark_dream 阅读(125) 评论(0) 编辑收藏举报