Pagini recente » Cod sursa (job #477780) | Cod sursa (job #1401547) | Cod sursa (job #1151895) | Cod sursa (job #2237412) | Cod sursa (job #873504)
Cod sursa(job #873504)
#include<fstream>
#include<vector>
#include<cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int nr,i,n,m,k,a[2000000],sol[1001];
char s1[2000001],s2[2000001];
void prefix()
{
for (i=1;i<n;i++)
{
while (s1[i]!=s1[k] && k)
k=a[k-1];
if (s1[i]==s1[k]) k++;
a[i]=k;
}
}
int main()
{
f.getline(s1,2000001);
f.getline(s2,2000001);
n=strlen(s1);
m=strlen(s2);
prefix();
k=0;
for (i=0;i<m;i++)
{
while (s1[k]!=s2[i] && k)
k=a[k-1];
if (s1[k]==s2[i]) k++;
if (k==n)
{
nr++;
if (nr<=1000) sol[nr]=i-n+1;
k=a[k-1];
}
}
g<<nr<<endl;
if (nr>1000)
nr=1000;
for (i=1;i<=nr;i++)
g<<sol[i]<<' ';
}