Pagini recente » Cod sursa (job #837082) | Cod sursa (job #306625) | Cod sursa (job #2753541) | Cod sursa (job #1216933) | Cod sursa (job #2056327)
#include <fstream>
#include <string.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char A[2000006],B[2000006];
int i,q,n,pi[2000006],M,N,pos[2000006];
void KMP()
{
for(i=1;i<=N;i++)
{
while(q&&A[q+1]!=B[i]) q=pi[q];
if(A[q+1]==B[i]) ++q;
if(q==M)
{
q=pi[M];
++n;
pos[n] = i-M;
}
}
}
void prefix()
{
int i, q=0;
pi[1]=0;
for(i=2;i<=M;++i)
{
while(q&&A[q+1]!=A[i]) q=pi[q];
if(A[q+1]==A[i])++q;
pi[i] = q;
}
}
int main()
{
fin.getline(A,2000006);
fin.getline(B,2000006);
M=strlen(A);
N=strlen(B);
for(i=M;i;--i) A[i]=A[i-1];A[0]=' ';
for(i=N;i;--i) B[i]=B[i-1];B[0]=' ';
prefix();
KMP();
fout<<n<<'\n';
for(i=1;i<=n;++i) fout<<pos[i]<<' ';
return 0;
}