Pagini recente » Cod sursa (job #1114184) | Cod sursa (job #723640) | Cod sursa (job #2148414) | Cod sursa (job #2254271) | Cod sursa (job #631372)
Cod sursa(job #631372)
#include <fstream>
#include <cstring>
#include <iostream>
#define N 2000010
using namespace std;
std::ifstream in ("strmatch.in");
std::ofstream out ("strmatch.out");
char s[N],w[N];
long pmt[N],i,k,c[N],l,n,m;
void ff (char *a) {
pmt[0]=-1;
for (i=1; a[i-1]; i++) if (a[i-1]==a[pmt[i-1]]) pmt[i]=pmt[i-1]+1;
}
void kmp (char *s,char *w) {
k=0;
while (k+m<=n) {
i=0;
while (s[k]==w[i]&&k<n) {
k++;
i++;
if (i==m) c[l++]=k-i;
}
k-=pmt[i];
}
}
int main () {
in.getline (w,N);
in.getline (s,N);
n=strlen (s);
m=strlen (w);
ff (w);
kmp (s,w);
out<<l<<"\n";
for (i=0; i<l; i++) out<<c[i]<<" ";
out<<"\n";
return 0;
}