Pagini recente » Cod sursa (job #652835) | Cod sursa (job #1525338) | Cod sursa (job #2599561) | Cod sursa (job #538682) | Cod sursa (job #2314452)
#include<cstdio>
#include<cstring>
#define MAX_LEN 2000000
#define MAX_POS 1000
using namespace std;
char P[MAX_LEN+1], T[MAX_LEN+1];
int pi[MAX_LEN], poz[MAX_POS], n, m, l;
void read() {
FILE* fin = fopen("strmatch.in","r");
fscanf(fin,"%s%s",P,T);
//printf("%s\n%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(l < MAX_POS)
poz[l++] = i - m + 1;
else l++;
}
}
}
void write() {
int i;
FILE* fout = fopen("strmatch.out","w");
fprintf(fout,"%d\n",l);
if(l > MAX_POS)
l = MAX_POS;
for(i = 0; i < l; i++)
fprintf(fout,"%d ",poz[i]);
fprintf(fout,"\n");
fclose(fout);
}
int main() {
read();
buildPrefix();
KMP();
write();
return 0;
}