Pagini recente » Cod sursa (job #60144) | Cod sursa (job #2742553) | Cod sursa (job #2714863) | Cod sursa (job #1008288) | Cod sursa (job #1090804)
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
using namespace std;
#define DIM 2000005
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int n, m, nrsol;
vector<int> pi(DIM);
vector<int> sol;
string P, T;
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 << nrsol << '\n';
for (int i = 0; i < nrsol; ++i)
fout << sol[i] << ' ';
}
void KMP()
{
int q = 0;
for (int i = 1; i <= n; ++i)
{
while ( q && P[q+1] != T[i] )
q = pi[q];
if ( P[q+1] == T[i] ) q++;
if ( q == m )
{
q = pi[q];
if ( nrsol == 1000 ) return;
else
{
nrsol++;
sol.push_back(i-m);
}
}
}
}
void Prefix()
{
int k = 0;
n = T.size()-1;
m = P.size()-1;
for (int q = 2; q <= m; ++q)
{
while ( k && P[k+1] != P[q] )
k = pi[k];
if ( P[k+1] == P[q] )
k++;
pi[q] = k;
}
}
void Read()
{
string a, b;
fin >> a >> b;
T.push_back('0');
P.push_back('0');
T += b, P += a;
}