Pagini recente » Cod sursa (job #2611614) | Cod sursa (job #1317665) | Cod sursa (job #2660546) | Cod sursa (job #868237) | Cod sursa (job #2543259)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char a[2000004],b[200004];
int pi[200004],v[1002],nr,aa,bb;
void kmp1()
{
int k=0;
for(int i=1;i<=bb;++i)
{
while(k && a[k+1]!=b[i])
k=pi[k];
if(a[k+1]==b[i]) ++k;
if(k==aa)
{
++nr;
if(nr<=1000)
v[nr]=i;
}
}
}
void kmp()
{
int k=0;
for(int i=2;i<=aa;++i)
{
while(k && a[k+1]!=a[i])
k=pi[k];
if(a[k+1]==a[i])++k;
pi[i]=k;
}
}
int main()
{
f>>(a+1);
f>>(b+1);
aa=strlen(a+1);
bb=strlen(b+1);
kmp();
kmp1();
g<<nr<<'\n';
for(int i=1;i<=min(nr,1000);++i)
g<<v[i]-aa<<' ';
return 0;
}