Pagini recente » Cod sursa (job #1649354) | Cod sursa (job #2076536) | Cod sursa (job #2486104) | Cod sursa (job #1769042) | Cod sursa (job #1830947)
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
string text, patern;
int lp[2000000];
vector <int> ap;
int l;
void make_patern()
{
int j=0;
for(int i=1;i<patern.length();i++)
{
if(patern[i]==patern[j])
{
lp[i]=j+1;
j++;
}
else
{
j--;
while(j>=0)
{
j=lp[j];
if(patern[i]==patern[j])
{
lp[i]=j+1;
j++;
break;
}
else
j--;
}
if(j<0)
lp[i]=0,j=0;
}
}
}
void rezolvare()
{
int j=0;
int lpatern=patern.length();
int lim=text.length();
for(int i=0;i<lim;i++)
{
//cout<<text[i]<<" "<<patern[j]<<j<<"\n";
if(text[i]==patern[j])
j++;
else
{
if(j>0)
j=lp[j-1];
}
if(j==lpatern)
{
ap.push_back(i-lpatern+1);
j = lp[j - 1];
}
}
}
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
getline(cin,patern);
//scanf("\n");
getline(cin,text);
make_patern();
rezolvare();
printf("%d\n", ap.size());
if(ap.size()<=1000)
{
for(int i=0;i<ap.size();i++)
printf("%d ", ap[i]);
}
else
{
for(int i=0;i<1000;i++)
printf("%d ", ap[i]);
}
return 0;
}