Pagini recente » Cod sursa (job #555973) | Cod sursa (job #1601722) | Cod sursa (job #2981000) | Cod sursa (job #2857272) | Cod sursa (job #3202881)
#include <bits/stdc++.h>
#define MAXSZ 2000005
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char a[MAXSZ], b[MAXSZ];
int lps[MAXSZ] = {0};
int main() {
fin.getline(a, MAXSZ);
fin.getline(b, MAXSZ);
int q = 0;
int n = (int) strlen(a);
int m = (int) strlen(b);
for (int i = 2; i <= n; i++) {
while (q && a[q] != a[i - 1])
q = lps[q];
if (a[q] == a[i - 1])
q++;
lps[i] = q;
}
vector<int> matches;
q = 0;
for (int i = 1; i <= m; i++) {
while (q && a[q] != b[i - 1])
q = lps[q];
if (a[q] == b[i - 1])
q++;
if (q == n) {
q = lps[q];
matches.push_back(i - n);
}
}
fout << matches.size() << '\n';
for (int i = 0; i < min((int) matches.size(), 1000); i++)
fout << matches[i] << ' ';
return 0;
}