Pagini recente » Cod sursa (job #2921910) | Cod sursa (job #3002296) | Cod sursa (job #74723) | Cod sursa (job #1019644) | Cod sursa (job #2242985)
#include<cstdio>
#include<cstring>
#define MAX_N 2000000
#define MAX_POS 1000
char P[MAX_N+1], T[MAX_N+1];
int pi[MAX_N], pos[MAX_POS], n, m, len;
void read() {
FILE* fin = fopen("strmatch.in","r");
fscanf(fin,"%s%s",P,T);
n = strlen(T);
m = strlen(P);
fclose(fin);
}
void buildPrefix() {
int i, k = 0;
pi[0] = 0;
for(i = 1; i < m; i++) {
while(k > 0 && P[i] != P[k])
k = pi[k - 1];
if(P[i] == P[k])
k++;
pi[i] = k;
}
}
void KMP() {
int i, k = 0;
for(i = 0; i < n; i++) {
while(k > 0 && T[i] != P[k])
k = pi[k - 1];
if(T[i] == P[k])
k++;
if(k == m) {
if(len < MAX_POS)
pos[len++] = i - m + 1;
else len++;
}
}
}
void write() {
FILE* fout = fopen("strmatch.out","w");
fprintf(fout,"%d\n",len);
if(len > MAX_POS)
len = MAX_POS;
for(int i = 0; i < len; i++)
fprintf(fout,"%d ",pos[i]);
fprintf(fout,"\n");
fclose(fout);
}
int main() {
read();
buildPrefix();
KMP();
write();
return 0;
}