Pagini recente » Cod sursa (job #822894) | Cod sursa (job #2718720) | Cod sursa (job #3184262) | Cod sursa (job #289406) | Cod sursa (job #631436)
Cod sursa(job #631436)
#include <fstream>
#include <cstring>
#define N 2000010
std::ifstream in ("strmatch.in");
std::ofstream out ("strmatch.out");
char s[N],w[N];
long pmt[N],i,k,c[N],l=0,n,m;
void ff (char *a) {
pmt[0]=-1;
for (i=1; i<=m; i++) if (a[i-1]==a[pmt[i-1]]) pmt[i]=pmt[i-1]+1;
}
void kmp (char *s,char *w) {
k=0; i=0;
while (k+i<n) {
if (w[i]==s[k+i]) {
if (i==m-1) c[l++]=k;
i++;
}
else {
k=k+i-pmt[i];
if (pmt[i]>-1) i=pmt[i];
else i=0;
}
}
}
int main () {
in.getline (w,N);
in.getline (s,N);
m=strlen (w);
n=strlen (s);
ff (w);
kmp (s,w);
out<<l<<"\n";
if (l>1000) l=1000;
for (i=0; i<l; i++) out<<c[i]<<" ";
out<<"\n";
return 0;
}