Pagini recente » Cod sursa (job #362986) | Cod sursa (job #132863) | Cod sursa (job #263366) | Cod sursa (job #1694720) | Cod sursa (job #1670054)
#include <iostream>
#include <string.h>
#include <fstream>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int n, m;
int prefix[2000005], pos[1005], nr;
char N[2000005], M[2000005];
int main()
{
f.getline(M, 2000001);
f.getline(N, 2000001);
n = strlen(N);
m = strlen(M);
for(int i = n; i > 0; i--) N[i] = N[i-1];
for(int i = m; i > 0; i--) M[i] = M[i-1];
M[0] = N[0] = ' ';
int q = 0;
for(int i = 2; i <= m; i++)
{
while(q && M[q+1] != M[i]) q = prefix[q];
if(M[q+1] == M[i]) q++;
prefix[i] = q;
}
q = 0;
for(int i = 1; i <= n; i++)
{
while(q && M[q+1] != N[i]) q = prefix[q];
if(M[q+1] == N[i]) q++;
if(q == m)
{
pos[++nr] = i - m;
if(nr == 1000) i = n+1;
q = prefix[q];
}
}
g<<nr<<'\n';
for(int i = 1; i <= nr; i++) g<<pos[i]<<' ';
g<<'\n';
return 0;
}