Pagini recente » Cod sursa (job #1034043) | Cod sursa (job #2735612) | Cod sursa (job #868226) | Cod sursa (job #2168982) | Cod sursa (job #1131008)
#include <fstream>
#include <cstring>
using namespace std;
#define LMax 2000005
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char A[LMax],B[LMax];
int m,n,pi[LMax];
int nr,sol[1005];
void pref()
{
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;
}
}
void solve()
{
int i,q=0;
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[q];
++nr;
if(nr<=1000) sol[nr]=i-m;
}
}
}
int main()
{
int i;
f>>A>>B;
m=strlen(A);
n=strlen(B);
A[m+1]=B[n+1]='\0';
for(i=m;i>=1;i--) A[i]=A[i-1];
for(i=n;i>=1;i--) B[i]=B[i-1];
pref();
solve();
g<<nr<<"\n";
if(nr>1000) nr=1000;
for(i=1;i<=nr;i++) g<<sol[i]<<" ";
g<<"\n";
f.close();
g.close();
return 0;
}