Pagini recente » Cod sursa (job #1021484) | Cod sursa (job #363318) | Cod sursa (job #2154404) | Cod sursa (job #2603016) | Cod sursa (job #1397911)
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
string A,B;
vector < int > v;
int nA, nB;
vector < int > sol;
void citire()
{
in>>A>>B;
nA=A.size();
nB=B.size();
}
void calc_v()
{
v.resize(nA,0);
int i=2,cnd=0;
v[0]=-1;
v[1]=0;
while(i<nA)
{
if(A[i-1]==A[cnd])
{
cnd++;
v[i]=cnd;
i++;
}
else if(cnd)
cnd=v[cnd];
else
i++;
}
}
void rezolvare()
{
int i=0,m=0;
while(i+m<nB)
{
if(A[i]==B[i+m])
{
i++;
if(i==nA)
{
if(sol.size()==1000)
break;
sol.push_back(m);
i--;
if(v[i]>-1)
{
m+=i-v[i];
i=v[i];
}
else
{
i=0;
m++;
}
}
}
else
{
if(v[i]>-1)
{
m+=i-v[i];
i=v[i];
}
else
{
i=0;
m++;
}
}
}
}
void afisare()
{
out<<sol.size()<<'\n';
for(auto x : sol)
out<<x<<' ';
}
int main()
{
citire();
calc_v();
rezolvare();
afisare();
return 0;
}