Pagini recente » Cod sursa (job #3262786) | Cod sursa (job #542206) | Cod sursa (job #2142006) | Cod sursa (job #1721261) | Cod sursa (job #2339810)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char S[2000000];
char p[2000000];
int v[2000000],n,m,lps[2000000];
int kmp(int u)
{
int i=0,j=0;
while(i<n)
{
if (S[i]==p[j])
{
i++;
j++;
if (j==m)
{
u++;
v[u]=i-m;
j=lps[j-1];
}
}
else
{
if (j==0)
i++;
else
j=lps[j-1];
}
}
return u;
}
int main()
{
fin>>p;
fin>>S;
n=strlen(S);
m=strlen(p);
if (m>n)
fout<<0;
else
{
int i=1;
int len=0;
while (i<m)
{
if (p[i]==p[len])
{
len++;
lps[i]=len;
i++;
}
else
{
if (len==0)
{
i++;
}
else
len=lps[len-1];
}
}
int x=kmp(0);
fout<<x<<"\n";
for (int i=1; i<=x; i++)
{
fout<<v[i]<<" ";
}
}
return 0;
}