Pagini recente » Cod sursa (job #123199) | Cod sursa (job #2657597) | Cod sursa (job #2660696) | Cod sursa (job #2554144) | Cod sursa (job #2786849)
#include <bits/stdc++.h>
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
vector<int> z;
string a,b,s;
void z_algo()
{
int n=s.size();
z.resize(n+1);
int x=0,y=0;
for(int i=1;i<n;++i)
{
z[i]=max(0,min(z[i-x],y-i+1));
while(i+z[i]<n and s[z[i]]==s[i+z[i]])
x=i,y=i+z[i],++z[i];
}
}
vector<int> poz;
int main()
{
in>>a>>b>>s;
s=a+'#'+b;
z_algo();
for(int i=a.size()+1;i<s.size();++i)
if(z[i]==a.size()) poz.push_back(i-a.size()-1);
out<<poz.size()<<'\n';
for(int i=0;i<min(1000,(int)poz.size());++i)
out<<poz[i]<<' ';
out<<'\n';
return 0;
}