Pagini recente » Cod sursa (job #2134900) | Cod sursa (job #855705) | Cod sursa (job #1279592) | Cod sursa (job #1449891) | Cod sursa (job #1290055)
#include <fstream>
#include <vector>
using namespace std;
vector<int> Sol;
int pi[2000005];
void compute_pi(string A,int n)
{
pi[1] = 0;
int k = 0;
for(int i = 1; i < n; i++)
{
while(k > 0 && A[k] != A[i])
k = pi[k+1];
if(A[i] == A[k])
k++;
pi[i+1] = k;
}
}
int main()
{
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
string A,B;
fin >> A >> B;
int n = A.size();
int m = B.size();
if(n > m)
{
fout << "0";
return 0;
}
compute_pi(A,n);
int Nr = 0;
int k = 0;
for(int i = 0; i < m; i++)
{
while(k > 0 && A[k] != B[i])
k = pi[k];
if(A[k] == B[i])
k++;
if(k == n)
{
Sol.push_back(i-n+1);
}
}
fout << Sol.size() << "\n";
int lim = Sol.size();
if(lim > 1000) lim = 1000;
for(int i = 0; i < lim; i++)
fout << Sol[i] << " ";
}