Cod sursa(job #860619)

Utilizator AlexandruValeanuAlexandru Valeanu AlexandruValeanu Data 20 ianuarie 2013 14:42:19
Problema Potrivirea sirurilor Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.14 kb
#include <cstdio>
#include <cstring>

#define minim(a, b) ((a < b) ? a : b)
#define NMax 2000005

int M, N;
char A[NMax], B[NMax];
int pi[NMax], pos[1024];

void make_prefix(void)
{
    int i, q = 0;

    for (i = 2, pi[1] = 0; i <= M; ++i)
    {
        while (q && A[q+1] != A[i])
            q = pi[q];
        if (A[q+1] == A[i])
            ++q;
        pi[i] = q;
    }
}

int main(void)
{
    int i, q = 0, n = 0;

    freopen("strmatch.in", "r", stdin);
    freopen("strmatch.out", "w", stdout);

    fgets(A, sizeof(A), stdin);
    fgets(B, sizeof(B), stdin);

    M = strlen(A);
    N = strlen(B);

    for(int i = M; i > 0; i--)
        A[i] = A[i-1];

    for(int i = N; i > 0; i--)
        B[i] = B[i-1];
    N--;
    M--;

    make_prefix();

    for (i = 1; i <= N; ++i)
    {
        while (q && A[q+1] != B[i])
            q = pi[q];
        if (A[q+1] == B[i])
            ++q;
        if (q == M)
        {
            q = pi[M];
            ++n;
            if (n <= 1000)
                pos[n] = i-M;
        }
    }

    printf("%d\n", n);
    for (i = 1; i <= minim(n, 1000); ++i)
        printf("%d ", pos[i]);
    printf("\n");

    return 0;
}