Pagini recente » Cod sursa (job #1763294) | Cod sursa (job #151128) | Cod sursa (job #1776123) | Cod sursa (job #1937703) | Cod sursa (job #2922861)
#include<iostream>
#include<fstream>
#include<unordered_map>
#include<string>
#include<vector>
std::ifstream in("strmatch.in");
std::ofstream out("strmatch.out");
using namespace std;
int kmp[4000001];
string s, c;
vector<int>v;
void calc() {
kmp[1] = 0;
for (int i = 2; i <= s.size(); i++) {
int l = kmp[i - 1];
while (s[l + 1] != s[i] && l > 0) l = kmp[l];
if (s[l + 1] == s[i]) kmp[i] = l + 1;
else kmp[i] = 0;
}
}
int main() {
ios_base::sync_with_stdio(false);
in.tie(nullptr);
out.tie(nullptr);
in >> c >> s;
s = c + '$' + s + '0';
for (int i = s.size(); i > 0; i--)
s[i] = s[i - 1];
calc();
for (int i = 1; i <= s.size(); i++)
if (kmp[i] >= c.size()) v.push_back(i - 2 * c.size() - 1);
out << v.size() << '\n';
for (int i = 0; i < min((int)v.size(), 1000); i++) {
out << v[i] << ' ';
}
return 0;
}