Pagini recente » Cod sursa (job #2569379) | Cod sursa (job #25757) | Cod sursa (job #1648132) | Cod sursa (job #2269430) | Cod sursa (job #1167152)
// http://www.infoarena.ro/job_detail/1148147?action=view-source
/*
ABAB
0012
CABBCABABAB
01200123434
*/
#include <iostream>
#include <fstream>
#include <cstring>
#include <iomanip>
using namespace std;
int m,n,p[2000014],sol;
char a[2000014],b[2000014];
void make_p()
{
int i,j,k=0;
p[1]=0;
for (i=2;i<=n;i++)
{
while (k>0 && a[k+1]!=a[i])
k=p[k];
if (a[k+1]==a[i])
k++;
p[i]=k;
}
}
int main()
{
int i,j,k;
fstream f,g;
f.open("strmatch.in",ios::in);
g.open("strmatch.out",ios::out);
f>>a+1>>b+1;
g<<" \n";
n=strlen(a+1);
m=strlen(b+1);
make_p ();// creeaza vectorul p. ABAB->0012; ABACCABACAB 00100123412;
k=0;// k este pentru poz crt in a
for (i=1;i<=m;i++)
{
while (k>0 && a[k+1]!=b[i])// cat timp sunt in sirul a si nu se potriveste nimic in b ma duc la un alt prefix in speranata ca voi gasi ce imi doresc
k=p[k];
if (a[k+1]==b[i])
k++;
if (k==n)// am gasit!!!!!
{
k=p[k];// analog
sol++;
if (sol<=1000)
g<<i-n<<" ";
}
}
g.clear();
g.seekg(0,ios::beg);
g<<sol;
}