Pagini recente » Cod sursa (job #1330436) | Cod sursa (job #1893930) | Cod sursa (job #237429) | Cod sursa (job #1053838) | Cod sursa (job #2303113)
#include <fstream>
#include <cstring>
#include <vector>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char a[2000005], b[2000005];
int N, M;
void Read()
{
fin >> a >> b;
N = strlen(a);
M = strlen(b);
for(int i = N; i >= 1; i--)
a[i] = a[i - 1];
for(int i = M; i >= 1; i--)
b[i] = b[i - 1];
}
int pi[2000005];
void Prefixe()
{
int j;
j = pi[1] = 0;
for(int i = 2; i <= N; i++)
{
while(j && a[j + 1] != a[i])
j = pi[j];
if(a[j + 1] == a[i])
j++;
pi[i] = j;
}
}
vector <int> sol;
void KMP()
{
int j = 0;
for(int i = 1; i <= M; i++)
{
while(j && a[j + 1] != b[i])
j = pi[j];
if(a[j + 1] == b[i])
j++;
if(j == N)
{
if(sol.size() < 1000)
sol.push_back(i - N);
j = pi[j];
}
}
}
void Write()
{
fout << sol.size() << '\n';
for(auto it : sol)
fout << it << ' ';
}
int main()
{
Read();
Prefixe();
KMP();
Write();
return 0;
}