Pagini recente » Cod sursa (job #116988) | Cod sursa (job #3271071) | Cod sursa (job #1087346) | Cod sursa (job #691138) | Cod sursa (job #2738709)
#include <bits/stdc++.h>
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
const int lim=2e6+4;
vector<int> z(string s)
{
int n=s.size();
vector<int> z(n);
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];
}
}
return z;
}
vector<int> poz;
string a,b;
int main()
{
in>>a>>b;
b=a+'#'+b;
vector<int> v=z(b);
for(int i=a.size()+1;i<b.size();++i)
if(v[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]<<' ';
return 0;
}