Pagini recente » Cod sursa (job #1798697) | Cod sursa (job #1652307) | Cod sursa (job #3254026) | Cod sursa (job #3247492) | Cod sursa (job #946186)
Cod sursa(job #946186)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char A[2000002], B[2000002];
int pi[2000002], v[1002];
int N, M, a;
int minim(int nr1, int nr2)
{
if (nr1 <= nr2)
return nr1;
else
return nr2;
}
void prefix()
{
int k = -1;
pi[0] = -1;
for (int i = 1; i <= N - 1; ++i)
{
while (k > -1 && A[k + 1] != A[i])
k = pi[k];
if (A[k + 1] == A[i])
k += 1;
pi[i] = k;
}
}
void KMP()
{
int q = -1;
for (int i = 0; i <= M - 1; ++i)
{
while (q > -1 && A[q + 1] != B[i])
q = pi[q];
if (A[q + 1] == B[i])
q += 1;
if (q == N - 1)
{
++a;
if (a <= 1000)
v[a] = i - N + 1;
}
}
}
void afisare()
{
fout << a << '\n';
for (int i = 1; i <= minim(a, 1000); ++i)
fout << v[i] << " ";
}
int main()
{
fin.getline(A, 2000002);
fin.getline(B, 2000002);
N = strlen(A);
M = strlen(B);
prefix();
KMP();
afisare();
fin.close();
fout.close();
}