Pagini recente » Cod sursa (job #559341) | Cod sursa (job #1071624) | Cod sursa (job #727216) | Cod sursa (job #1418305) | Cod sursa (job #1810696)
#include<fstream>
#include<iostream>
#include<cstring>
#include<vector>
#define NMax 2000005
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int M,N,q;
char A[NMax],B[NMax];
int pi[NMax];
vector <int> Sol;
void Read()
{
fin.getline(A+1,NMax);
fin.getline(B+1,NMax);
A[0] = B[0] = ' ';
N = strlen(A); N--;
M = strlen(B); M--;
}
void Precalculate()
{
pi[1] = 0;
for(int i = 2 ; i <= N; ++i)
{
while(q && A[q+1] != A[i])
q = pi[q];
if(A[q+1] == A[i])
q++;
pi[i] = q;
}
}
void KMP()
{
q = 0;
for(int i = 1; i <= M; ++i)
{
while(q && A[q+1] != B[i])
q = pi[q];
if(A[q+1] == B[i])
q++;
if(q == N)
{
q = pi[N];
if(Sol.size() < 1000)
Sol.push_back(i-N);
}
}
}
void Print()
{
fout<<Sol.size()<<"\n";
for(int i = 0 ; i < (int) Sol.size() ; ++i)
fout<<Sol[i]<<" ";
fout<<"\n";
}
int main(void)
{
Read();
Precalculate();
KMP();
Print();
fin.close();
fout.close();
return 0;
}