Pagini recente » Cod sursa (job #3224744) | Cod sursa (job #3283921) | Cod sursa (job #3273016) | Cod sursa (job #1291129) | Cod sursa (job #2453920)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> zAlgorithm(const string& str)
{
const int N = str.size();
vector<int> z(N);
int L = 0, R = 0;
for (int i = 1; i < N; ++i)
{
if (i <= R)
z[i] = min(R - i + 1, z[i - L]);
while (i + z[i] < N && str[z[i]] == str[i + z[i]])
z[i]++;
if (i + z[i] - 1 > R)
{
L = i;
R = i + z[i] - 1;
}
}
return z;
}
int main()
{
ifstream in("strmatch.in");
ofstream out("strmatch.out");
string A, B;
in >> A >> B;
auto z = zAlgorithm(A + "$" + B);
vector<int> aparitii;
for (int i = A.size() + 1; i < z.size(); ++i)
if (z[i] == A.size())
aparitii.push_back(i - A.size() - 1);
out << aparitii.size() << endl;
aparitii.resize(min((size_t)1000, aparitii.size()));
for_each(aparitii.begin(), aparitii.end(), [&out](int x){out << x << " ";});
return 0;
}