Pagini recente » Cod sursa (job #454143) | Cod sursa (job #1120693) | Cod sursa (job #2435836) | Cod sursa (job #1204332) | Cod sursa (job #305223)
Cod sursa(job #305223)
#include<iostream>
#include<fstream>
#include<string.h>
using namespace std;
ifstream f ("strmatch.in");
ofstream o ("strmatch.out");
long n,m,i,j,k,sir[2000000],nrap,ap[1001];
char a[2000000],b[2000000];
void functie(char c[2000000])
{
m=strlen(c);
sir[0]=0;
sir[-1]=-1;
k=-1;
for(int i=1;i<m;i++)
{
while( k>-1 && c[k+1]!=c[i] )
k=sir[k];
if(c[k+1]==c[i])
k++;
sir[i]=k;
}
}
void kmp()
{
n=strlen(b);
m=strlen(a);
functie(a);
j=-1;
for(i=0;i<n;i++)
{
while(j>-1 && a[j+1]!=b[i])
j=sir[j];
if(a[j+1]==b[i])
j++;
if(j==m-1)
{
// o<<"\n Modelul apare cu deplasamentul "<<i-m+1;
j=sir[j];ap[nrap++]=i-m+1;
}
}
}
int main()
{
f.get(a,2000000);
f.get();
f.get(b,2000000);
kmp();
o<<nrap<<"\n";
for(i=0;i<=1000 && ap[i];i++)
o<<ap[i]<<" ";
return 0;}