Pagini recente » Cod sursa (job #2751925) | Cod sursa (job #1948414) | practice_arena | Cod sursa (job #2153764) | Cod sursa (job #3206640)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
#define NMAX 2000005
char a[NMAX], b[NMAX];
int p[NMAX];
int v[NMAX];
void build(int n) {
int k = 0;
for (int i = 2; i <= n; ++i) {
while (k > 0 && a[i] != a[k + 1]) {
k = p[k];
}
if (a[i] == a[k + 1]) {
k++;
}
p[i] = k;
}
}
int main() {
fin.getline(a + 1, NMAX - 1);
fin.getline(b + 1, NMAX - 1);
a[0] = 'a';
b[0] = 'b';
int n = strlen(a + 1);
int m = strlen(b + 1);
build(n);
int k = 0;
int nr = 0;
for (int i = 1; i <= m; ++i) {
while (k > 0 && a[k + 1] != b[i]) {
k = p[k];
}
if (a[k + 1] == b[i]) {
k++;
}
if (k == n) {
nr++;
if (nr <= 1000) {
v[nr] = i - k;
}
k = p[k];
}
}
fout << nr << '\n';
for (int i = 1; i <= nr && i <= 1000; ++i) {
fout << v[i] << ' ';
}
return 0;
}