Pagini recente » Cod sursa (job #1909411) | Cod sursa (job #2199249) | Istoria paginii runda/cartof | Cod sursa (job #1957992) | Cod sursa (job #1908963)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int n, m;
string a, b, s;
vector<int>Zalgo(const string &that) {
vector<int>z(that.size(), 0);
int l = 0, r = 0;
for (int i = 1; i < that.size(); ++i) {
if(i <= r) {
z[i] = min(z[i - l], r - i);
}
while (i + z[i] < that.size() and s[z[i]] == s[i + z[i]]) {
z[i]++;
}
if (i + z[i] > r) {
r = i + z[i];
l = i;
}
}
return z;
}
int main() {
fin >> a >> b;
s = a + '$' + b;
auto z = Zalgo(s);
vector<int>match;
for (int i = a.size()+1; i < s.size(); ++i) {
if (z[i] == a.size()) {
match.push_back(i - a.size() - 1);
}
}
fout << match.size() << '\n';
for (int i = 0; i < min(1000, (int)match.size()); ++i)
fout << match[i] << ' ';
return 0;
}