Pagini recente » Cod sursa (job #371457) | Cod sursa (job #2384048) | Cod sursa (job #1269469) | Cod sursa (job #765232) | Cod sursa (job #1090780)
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int n, m, k;
string P, T;
vector<int> pi;
vector<int> sols;
void Read();
void Prefix();
void KMP();
void Write();
int main()
{
Read();
Prefix();
KMP();
Write(); fout << '\n';
fin.close();
fout.close();
return 0;
}
void Write()
{
fout << sols.size() << '\n';
vector<int>::iterator it;
for (it = sols.begin(); it != sols.end(); ++it)
fout << *it << ' ';
}
void KMP()
{
int q = 0;
for (int i = 1; i <= n; ++i)
{
while ( q > 0 && P[q] != T[i-1] )
q = pi[q];
if ( P[q] == T[i-1] )
q++;
if ( q == m )
{
sols.push_back(i-m);
q = pi[q];
}
}
}
void Prefix()
{
m = P.length();
n = T.length();
pi.resize(n+1);
for (int q = 2; q <= m; ++q)
{
while ( k > 0 && P[k] != P[q-1] )
k = pi[k];
if ( P[k] == P[q-1] )
k++;
pi[q] = k;
}
}
void Read()
{
fin >> P >> T;
}