Cod sursa(job #1379102)

Utilizator NacuCristianCristian Nacu NacuCristian Data 6 martie 2015 16:20:03
Problema Potrivirea sirurilor Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.28 kb
#include <iostream>
#include <fstream>
#include <string.h>
#include <vector>

using namespace std;

char s1[2000100],s2[2000100];
int pi[2000100],m,n;
vector <int> sol;

void citire()
{
    ifstream fin("strmatch.in");
    fin.getline(s1,2000100);
    fin.getline(s2,2000100);
    m=strlen(s1),n=strlen(s2);
    for(int i=m;i>=0;i--)
        s1[i+1]=s1[i];
    s1[0]=' ';
    for(int i=n;i>=0;i--)
        s2[i+1]=s2[i];
    s2[0]=' ';
    if(m>n))
        swap(s1,s2);
}

void prefix()
{
    int q=0;
    pi[1]=0;
    for(int i=2;i<strlen(s1);i++)
    {
        while(q && s1[i]!=s1[q+1])
            q=pi[q];
        if(s1[i]==s1[q+1])
            q++;
        pi[i]=q;
    }
}


void kmp()
{

    prefix();
    for(int i=1,j=1,k=1;n-k>=m;)
    {
        while(s1[j]==s2[i] && j<=m)
            i++,j++;
        if(j>m-1)
            sol.push_back(k-1);
        if(pi[j-1])
            k=i-pi[j-1];

        else
        {
            if(k==i)
                i++;
            k=i;
        }
        if(j>1)
            j=pi[j-1]+1;
    }
}


int main()
{
    citire();
    kmp();
    freopen("strmatch.out","w",stdout);
    printf("%d\n",sol.size());
    for(int i=0;i<sol.size();i++)
        printf("%d ",sol[i]);
    return 0;
}