Cod sursa(job #1360094)

Utilizator mirceadinoMircea Popoveniuc mirceadino Data 25 februarie 2015 11:35:16
Problema Potrivirea sirurilor Scor 52
Compilator cpp Status done
Runda Arhiva educationala Marime 1.3 kb
#include<cstdio>
#include<string>
#include<cstring>

using namespace std;

#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "strmatch";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

const int NMAX = 2000000 + 5;

int N, M;
int pi[NMAX];
char A[NMAX];
char B[NMAX];
int nr_matches;
int matches[1005];

void prefix() {
    int i, q;

    for(i = 2; i <= N; i++) {
        while(A[q + 1] != A[i] && q)
            q = pi[q];

        if(A[q + 1] == A[i])
            q++;

        pi[i] = q;
    }
}

void kmp() {
    int i, q;

    for(i = 1; i <= M; i++) {
        while(A[q + 1] != B[i] && q)
            q = pi[q];

        if(A[q + 1] == B[i])
            q++;

        if(q == N) {
            nr_matches++;
            if(nr_matches <= 1000)
                matches[nr_matches] = i - N;
            q = pi[q];
        }
    }
}

int main() {
    int i;

    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);

    scanf("%s", A + 1);
    scanf("%s", B + 1);

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

    prefix();
    kmp();

    printf("%d\n", nr_matches);

    for(i = 1; i <= min(nr_matches, 1000); i++)
        printf("%d ", matches[i]);

    return 0;
}