Pagini recente » Cod sursa (job #2521626) | Cod sursa (job #856001) | Cod sursa (job #1991234) | Cod sursa (job #753173) | Cod sursa (job #1370062)
#include<iostream>
#include<cstdio>
#include<string.h>
#include<vector>
using namespace std;
int l[2000002];
char pattern[2000002],text[2000002];
std::vector<int> a;
void preKMP(char pattern[])
{
l[1] = 0;
int k;
for(int i=2;i<strlen(pattern);++i)
{
k = l[i-1];
while(k>0 && pattern[k+1] != pattern[i])
k = l[k];
if(pattern[k+1]==pattern[i])k++;
l[i] = k;
}
}
void KMP(char pattern[],char text[])
{
preKMP(pattern);
int k = 0;
for(int i=1;i<strlen(text);++i)
{
while(k>0 && pattern[k+1] != text[i])
k = l[k];
if(pattern[k+1]==text[i])k++;
if(k == strlen(pattern)-1)
{
a.push_back(i-k);
k = l[k];
}
}
}
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
cin>>(pattern+1)>>(text+1);
pattern[0] = '*';
text[0] = '*';
KMP(pattern,text);
cout<<a.size()<<'\n';
for(int i=0;i<a.size();++i)cout<<a[i]<<" ";
}