Pagini recente » Cod sursa (job #2805701) | Borderou de evaluare (job #1560400) | Monitorul de evaluare | Borderou de evaluare (job #2283912) | Cod sursa (job #3345926)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
#define nmax 2000010
char a[nmax],b[nmax];
int lps[nmax],ans[1001],anscnt,n,m,i,j;
void computelps()
{
lps[0]=0;
i=1;
j=0;
while(i<n)
{
if(a[i]==a[j])
{
j++;
lps[i]=j;
i++;
}
else
if(j)
j=lps[j-1];
else
lps[i]=0,i++;
}
}
int main()
{
fin>>a>>b;
n=strlen(a);
m=strlen(b);
computelps();
for(i=j=0 ; i<m ; )
{
if(a[j]==b[i])
{
i++;
j++;
}
if(j==n)
{
anscnt++;
if(anscnt<=1000)
ans[anscnt]=i-j;
j=lps[j-1];
}
else
if(i<m && a[j]!=b[i])
if(j)
j=lps[j-1];
else
i++;
}
fout<<anscnt<<'\n';
anscnt=min(anscnt,1000);
for(int i=1;i<=anscnt;i++)
fout<<ans[i]<<' ';
return 0;
}