Pagini recente » Cod sursa (job #1504411) | Cod sursa (job #3211490) | Cod sursa (job #1862961) | Cod sursa (job #2723885) | Cod sursa (job #2238722)
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
vector<int> ans;
int Z[4000005];
void ZAlg(string concat){
int L = 0, R = 0, k;
for(int i = 1; i < int(concat.size()); i++){
if (i > R) {
L = R = i;
while (R < int(concat.size()) && concat[R - L] == concat[R])
R++;
Z[i] = R - L;
R--;
}
else {
k = i - L;
if (Z[k] < R - i + 1)
Z[i] = Z[k];
else{
L = i;
while (R < int(concat.size()) && concat[R - L] == concat[R])
R++;
Z[i] = R - L;
R--;
}
}
}
}
void Zsearch(string pat, string txt){
string concat = pat + "$" + txt;
ZAlg(concat);
for(int i = 0; i < int(concat.size()); ++i)
if(Z[i] == int(pat.size()))
ans.push_back(i - pat.size() - 1);
}
int main()
{
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
string word, phrase;
fin >> word >> phrase;
Zsearch(word, phrase);
int len = min(1000, int(ans.size()));
fout << len << "\n";
for(int i = 0; i < len; ++i)
fout << ans[i] << " ";
return 0;
}