Pagini recente » Istoria paginii runda/cls_11_simulare_oji | Cod sursa (job #1224321) | Cod sursa (job #532642) | Cod sursa (job #1920045) | Cod sursa (job #1456073)
#include <cstdio>
#include <cstring>
using namespace std;
const int DIM = (1<<22);
int N, M, i, j, k, k2, R, L;
int Z[DIM], Sol[DIM], nr;
char A[DIM], B[DIM], S[DIM];
int main(){
freopen("strmatch.in" ,"r", stdin );
freopen("strmatch.out","w", stdout);
scanf("%s", A + 1); N = strlen(A + 1);
scanf("%s", B + 1); M = strlen(B + 1);
for(int i = 1; i <= N; i ++)
S[i+0+0] = A[i];
for(int i = 1; i <= M; i ++)
S[i+N+1] = B[i];
S[N+1] = '$';
N += M + 1;
Z[0] = N;
for(int i = 2; i <= N; i ++){
if(i > R){
L = i;
R = i;
while(S[R] == S[R-L+1])
R ++;
Z[i] = R - L;
R --;
}
else {
int K = i - L + 1;
if(Z[K] < R - i + 1){
Z[i] = Z[K];
}
else {
L = i;
while(S[R] == S[R-L+1])
R ++;
Z[i] = R - L;
R --;
}
}
if(Z[i] >= N - M - 1 && nr < 1000)
Sol[++nr] = i - Z[i] - 2;
}
printf("%d\n", nr);
for(int i = 1; i <= nr; i ++)
printf("%d ", Sol[i]);
fclose(stdin );
fclose(stdout);
return 0;
}