Cod sursa(job #2675142)

Utilizator ioana0211Ioana Popa ioana0211 Data 21 noiembrie 2020 10:37:30
Problema Potrivirea sirurilor Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.54 kb
#include <iostream>
#include <fstream>
#include <string.h>

using namespace std;

ifstream fin("strmatch.in");
ofstream fout("strmatch.out");

#define MAXLENGTH 2000001

/* Variable Declarations */
char text[MAXLENGTH], pattern[MAXLENGTH];
int t, p;
int n, result[MAXLENGTH];

/// Part b. Ignore for now
int lps[MAXLENGTH];


void calculateLPSArray() {
    int i=1, len=0;
    while(i<p)
    {
        if(pattern[i]==pattern[len]){
            lps[i]=len+1;
            len++;
            i++;
        }
        else
        {
            if(len!=0)
                len=lps[len-1];
            else
                lps[i++]=0;
        }
    }
}

void printLPSArray() {
    for (int i=0; i<p; i++) {
        fout<<lps[i]<<" ";
    }
    fout<<endl;
}

void findPatternMatches() {
    calculateLPSArray();
    int i=0, j=0;
    while(i<t)
    {
        if(text[i]==pattern[j])
        {
            i++;
            j++;
        }else{
            if(j)
                j=lps[j-1];
            else
                i++;
        }
        if(j==p){
            result[n++]=i-j;
            j=lps[j-1];
        }
    }
}

void printResult() {
    fout<<n<<"\n";
    if (n > 1000) {
        n = 1000;
    }
    for (int i=0; i<n; i++) {
        fout<<result[i]<<" ";
    }
}

int main()
{
    fin.getline(pattern, MAXLENGTH);
    fin.getline(text, MAXLENGTH);
    p = strlen(pattern);
    t = strlen(text);

    findPatternMatches();
    //printLPSArray();
    printResult();

    return 0;
}