Pagini recente » Cod sursa (job #151307) | Istoria paginii runda/cex_ph_6/clasament | Cod sursa (job #1990477) | Cod sursa (job #1466969) | Cod sursa (job #873044)
Cod sursa(job #873044)
#include<fstream>
#include<vector>
#include<string.h>
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
int i,n,m,k,a[2000000];
char s1[2000000],s2[2000000];
vector<int> Q;
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()
{
in.getline(s1,2000000);
in.getline(s2,2000000);
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==strlen(s1))
{
Q.push_back(i-n+1);
k=a[k-1];
}
}
out<<Q.size()<<'\n';
for (i=0;i<Q.size();i++)
{
if (i==1000) return 0;
out<<Q[i]<<' ';
}
}