Pagini recente » Cod sursa (job #903895) | Cod sursa (job #3290572) | Cod sursa (job #1659473) | Cod sursa (job #1328216) | Cod sursa (job #897809)
Cod sursa(job #897809)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
char a[2000001],b[2000001];
int po,n,m,pi[2000000],sol[2000001];
void citire()
{
ifstream f("strmatch.in");
f>>a;
f>>b;
n=strlen(a);
m=strlen(b);
f.close();
}
void Prefix()
{
int k;
pi[0]=-1;
k=-1;
for(int q=1;q<n;q++)
{
while(k>-1 && a[k+1]!=a[q])
k=pi[k];
if(a[k+1]==a[q])
k++;
pi[q]=k;
}
}
void KMP()
{
int q;
Prefix();
q=-1;
for(int i=0;i<m;i++)
{
while(q>-1 && a[q+1]!=b[i])
q=pi[q];
if(a[q+1]==b[i])
q++;
if(q==n-1)
{
q=pi[n];
po++;
sol[po]=i-n+1;
}
}
}
void afisare()
{
ofstream g("strmatch.out");
g<<po<<"\n";
for(int i=1;i<=min(po,1000);i++)
g<<sol[i]<<" ";
g<<"\n";
g.close();
}
int main()
{
citire();
KMP();
afisare();
return 0;
}