poj3080解题报告

思路：先按字符串的长度由短到长进行快排。枚举第一个字符串的不同长度子串，判断她是否为下面多有的公共子串？如果是的话，那么我们就表明找到，则比较其长度，如果比已经找到的串长，那么就替换结果串 否则按字典序比较。取字典序考前的，就可以。

编程语言：C++

错误：曾因数组越界WA了2次，现已改正

代码如下：

#include<iostream>
#include<cstring>
#include<stdio.h>
using namespace std;
const int Max = 62;

char text[10][Max], pat[Max];
int n, ma, lenp, next[Max];

void get_next()
{
    int i = 0, j = -1;
    next[0] = -1;
    while(i < lenp)
    {
        if(j == -1 || pat[i] == pat[j])
        {
            i ++; j ++;
            next[i] = j;
        }
        else j = next[j];
    }
}

void KMP()
{
    int k, m, i, j;
    get_next();
    ma = 100;
    for(k = 1; k < n; k ++)
    {
        i = 0; j = 0; m = 0;
        while(i < 60 && j < lenp)
        {
            if(j == -1 || text[k][i] == pat[j])
            {
                i ++; j ++;
            }
            else j = next[j];
            if(j > m) m = j;
        }
        if(m < ma) ma = m;
    }
}

int main()
{
    int t, i;
    char result[Max];
    scanf("%d", &t);
    while(t --)
    {
        scanf("%d", &n);
        for(i = 0; i < n; i ++)
        scanf("%s", text[i]);
        int ans = 0;
        for(i = 0; i <= 57; i ++)
        {
            strcpy(pat, text[0] + i);    
            //cout<<pat<<endl;
            lenp = 60 - i;
            KMP();                      
            if(ans < ma)
            {
                ans = ma;
                strncpy(result, text[0] + i, ans);
                result[ans] = '\0';
            }
            else if(ans == ma)
            {        

                char tmp[Max];
                strncpy(tmp, text[0] + i, ans);  
                tmp[ans] = '\0';
                if(strcmp(tmp, result) < 0)
                strcpy(result, tmp);
            }
        }
        if(ans >= 3)
        printf("%s\n", result);
        else
        printf("no significant commonalities\n");
    }
    return 0;
}