Pagini recente » Cod sursa (job #2149111) | Cod sursa (job #1876170)
#include <fstream>
#include <vector>
#define VAL 2000005
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int N, M, i, j;
int FF[VAL];
int KMP[VAL], poz;
string P, S;
vector<int> ANS;
vector<int> :: iterator it;
int main()
{
fin >> P >> S;
N=P.size();
M=S.size();
P+='*';
for (i=1; i<N; i++)
{
poz=FF[i-1]-1;
while (poz>0)
{
if (P[i]==P[poz+1])
break;
else
poz=FF[poz-1]-1;
}
if (P[i]==P[poz+1])
FF[i]=poz+2;
}
for (i=1; i<M; i++)
{
poz=KMP[i-1]-1;
while (poz>0)
{
if (S[i]==P[poz+1])
break;
else
{
if (KMP[poz-1]!=0)
poz=KMP[poz-1]-1;
else
poz=0;
}
}
if (S[i]==P[poz+1])
KMP[i]=poz+2;
if (KMP[i]==N)
ANS.push_back(i-N+1);
}
fout << ANS.size() << '\n';
for (it=ANS.begin(); it!=ANS.end(); it++)
fout << *it << " ";
fin.close();
fout.close();
return 0;
}