Cod sursa(job #1993416)

Utilizator zsraduZamfir Radu zsradu Data 22 iunie 2017 22:08:43
Problema Potrivirea sirurilor Scor 32
Compilator cpp Status done
Runda Arhiva educationala Marime 1.25 kb
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int lga,lgb,i,pi[2000003],q,poz[1003],lg=0;
char a[2000003],b[2000003];
float x=1024;
int main()
{
    f.getline(a,2000000);//lga=strlen(a);
    f.getline(b,2000000);//lgb=strlen(b);
    for (; (a[lga] >= 'A' && a[lga] <= 'Z') || (a[lga] >= 'a' && a[lga] <= 'z')
            || (a[lga] >= '0' && a[lga] <= '9'); ++lga);
    for (; (b[lgb] >= 'A' && b[lgb] <= 'Z') || (b[lgb] >= 'a' && b[lgb] <= 'z')
            || (b[lgb] >= '0' && b[lgb] <= '9'); ++lgb);
    for(i=lga;i>0;i--)a[i]=a[i-1];a[0]=' ';
    for(i=lgb;i>0;i--)b[i]=b[i-1];b[0]=' ';
    q=0;
    for (i = 2, pi[1] = 0; i <= lga; ++i)
    {
        while (q && a[q+1] != a[i])
            q = pi[q];
        if (a[q+1] == a[i])
            ++q;
        pi[i] = q;
    }
    //q=0;
    //memset(pi,0,2000000);
    for(i=1;i<=lgb;i++)
    {
        while(q && a[q+1]!=b[i])
            q=pi[q];
        if(a[q+1]==b[i])
            q++;
        if(q==lga)
        {
            q=pi[q];
            lg++;
            if(lg<=1000)poz[lg]=i-lga;
        }
    }
    g<<lg<<'\n';
    for(i=1;i<=min(1000,lg);i++)
        g<<poz[i]<<" ";
}