kmp 练习2 poj 2185 poj 2406

poj 2185

题目大意：给一个矩阵，要你求出矩阵的最小覆盖的大小，即左上角多大长度的字符串能扩展覆盖到整个矩阵

解题思路，最小覆盖子串http://blog.csdn.net/fjsd155/article/details/6866991

每行的最小覆盖子串相互独立，所以求出每行最小覆盖子串的最小公倍数

同理求出每列最小覆盖子串的最小公倍数，两者相乘即为所求

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

const int maxr = 10001;
const int maxc = 76;

char matrix[maxr][maxc];

int r, c;

int get_next(int index, bool flag);
int gcd(int a, int b);
int lcm(int a,int b);

int main()
{

    scanf("%d %d", &r, &c);
    for(int i = 0; i < r; i++)
        scanf("%s", matrix[i]);
   
    int rl = get_next(0, true);
    int cl = get_next(0, false);
    for(int i = 1; i < r; i++)
    {
        if(rl >= c)
        {
            rl = c;
            break;
        }
        rl = lcm(rl, get_next(i, true));
    }
    for(int j = 1; j < c; j++)
    {
        if(cl >= r)
        {
            cl = r;
            break;
        }
        cl = lcm(cl, get_next(j, false));
    }
    printf("%d\n", rl * cl);
   
    return 0;
}

int get_next(int index, bool flag)
{
    int i, j, next[maxr];
    next[0] = -1;
    i = 0, j = -1;
    if(flag)
    {
        while(i < c)
        {
            if(j == -1 || matrix[index][i] == matrix[index][j])
            {
                i++; j++;
                next[i] = j;
            }
            else
                j = next[j];
        }
    }
    else
    {
        while(i < r)
        {
            if(j == -1 || matrix[i][index] == matrix[j][index])
            {
                i++; j++;
                next[i] = j;
            }
            else
                j = next[j];
        }
    }
    return i - next[i];
}

int gcd(int a, int b)
{
    return b == 0 ? a : gcd(b, a % b);
}

int lcm(int a, int b)
{
	return a * b / gcd(a,b);
}

 poj 2406

题目大意，给出几组字符串，要你求出每个字符串各由子串拼接而成的最多次数

解题思路：最小覆盖子串，和 poj 1961基本一样

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

const int maxn = 1000001;
char str[maxn];
int next[maxn];

void get_next(int len);

int main()
{
    while(true)
    {
        scanf("%s", str);
        if(str[0] == '.')
            break;
        int len = strlen(str);
        get_next(len);
        int l = len - next[len];
        if(len % l != 0)
            printf("1\n");
        else
            printf("%d\n", len / l);
    }
    return 0;
}

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