Pagini recente » Cod sursa (job #2357115) | Cod sursa (job #1685915) | Cod sursa (job #2130296) | Cod sursa (job #80149) | Cod sursa (job #2169250)
#include <iostream>
#include <fstream>
using namespace std;
const int nmax=4000005;
string a,b,s;
int z[nmax];
int rez[1005];
int n,i,j,len,r,c,ans;
int main()
{
ifstream f("strmatch.in");
ofstream g("strmatch.out");
f>>a>>b;len=a.size();
s=a+b;n=s.size();
for(i=1;i<n;i++)
{
if(i>r) j=0;
else j=max(min(z[i-c],r-i),0);
while(i+j<n&&s[j]==s[i+j]) j++;
j--;
z[i]=j;
if(i+j>r) r=i+j,c=i;
if(i>=len&&z[i]>=len-1)
{
ans++;
if(ans<=1000)
rez[ans]=i-len;
}
}
g<<ans<<'\n';
for(i=1;i<=min(ans,1000);i++)
g<<rez[i]<<' ';
return 0;
}