Pagini recente » Cod sursa (job #1477152) | Cod sursa (job #1454297) | Cod sursa (job #2224813) | Cod sursa (job #1463233) | Cod sursa (job #2374672)
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
#define minn(a,b) ((a<b) ? a : b)
const int LMAX=2e6 + 1;
char A[LMAX],B[LMAX];
int pi[LMAX];
void prefix()
{
int i=0,y=strlen(A+1);
pi[0]=0;
for(int j=2;j<=y;j++)
{
while(i!=0 && A[i+1]!=A[j])
i=pi[i];
if(A[i+1]==A[j])
i++;
pi[j]=i;
}
}
int main()
{
int i=0,x,y,NR=0;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
f>>(A+1)>>(B+1);
f.close();
x=strlen(B+1);
y=strlen(A+1);
vector <int> sol;
prefix();
for(int j=1;j<=x;j++)
{
while(i!=0 && A[i+1]!=B[j])
i=pi[i];
if(A[i+1]==B[j])
i++;
if(i==y)
{
NR++;
if(NR<=1000)
sol.push_back(j-i);
i=pi[y];
}
}
g<<NR<<'\n';
x=minn(NR,1000);
for(i=0;i<x;i++)
g<<sol[i]<<" ";
return 0;
}