Pagini recente » Cod sursa (job #1070666) | Cod sursa (job #1726316) | Cod sursa (job #1703826) | Cod sursa (job #1718179) | Cod sursa (job #921746)
Cod sursa(job #921746)
#include <fstream>
#include <cstring>
#define NMAX 2000001
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int i,j,n1,n2,rez[NMAX],k,ok,l[NMAX],p;
char s1[NMAX],s2[NMAX];
int main()
{
fin.get(s2,NMAX);
fin.get();
fin.get(s1,NMAX);
n1=strlen(s1);
n2=strlen(s2);
i=0;
j=-1;
if(n2>n1)
fout<<0<<'\n';
else
{
l[1]=0;
for(p=2;p<=n2;++p)
{
k=l[p-1];
while(k>0&&s2[k+1]!=s2[p])
k=l[k];
if(s2[k+1]==s2[p])
k++;
l[p]=k;
}
for(i=0;i<n1;++i)
{
while(j>=0&&s1[i]!=s2[j+1])
j=l[j]-1;
if(s1[i]==s2[j+1])
j++;
if(j+1==n2)
{rez[++k]=i-j;j=l[j];}
}
fout<<k<<'\n';
for(i=1;i<=k;++i)
fout<<rez[i]<<" ";
}
return 0;
}