Pagini recente » Cod sursa (job #285482) | Cod sursa (job #36151) | Cod sursa (job #1687233) | Cod sursa (job #628018) | Cod sursa (job #2714938)
#include <fstream>
#include <string>
#include <vector>
using namespace std;
ifstream cin("strmatch.in");
ofstream cout("strmatch.out");
const int NMAX = 2e6;
int N, M;
string pattern, text;
int pi[NMAX + 5];
vector <int> sol;
void Pi() {
pi[0] = -1;
int j = -1;
for(int i = 1; i < N; i++) {
while(j >= 0 && pattern[i] != pattern[j + 1]) {
j = pi[j];
}
if(pattern[i] == pattern[j + 1]) {
j++;
}
pi[i] = j;
}
}
void Kmp() {
int j = -1;
for(int i = 0; i < M; i++) {
while(j >= 0 && text[i] != pattern[j + 1]) {
j = pi[j];
}
if(text[i] == pattern[j + 1]) {
j++;
}
if(j == N - 1) {
sol.push_back(i - N + 1);
j = pi[j];
}
}
}
int main() {
cin >> pattern >> text;
N = (int)pattern.size();
M = (int)text.size();
Pi();
Kmp();
cout << (int)sol.size() << '\n';
for(int i = 0; i < min((int)sol.size(), 1000); i++) {
cout << sol[i] << ' ';
}
return 0;
}