Pagini recente » Cod sursa (job #1175951) | Cod sursa (job #1772029) | Cod sursa (job #3240630) | Cod sursa (job #2473175) | Cod sursa (job #2266734)
#include <iostream>
#include <fstream>
#include <string.h>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int l1,l2,i,z[2000005],sol,v[2000005];
char s1[4000005],s2[2000005];
void zf(char p[])
{
int l, r;
int n = strlen(p+1);
z[1] = 0;
l = 0;
r = 0;
for(i = 1; i <= n; i++){
if ( i <= r )
z[i] = min(z[i - l + 1], r - i + 1);
while( i + z[i] - 1 <= n && p[ i + z[i]] == p[z[i]+1])
z[i]++;
if(i + z[i] - 1 >= r)
{
r = i + z[i] - 1;
l = i;
}
}
}
int main()
{
f>>s1+1;
f>>s2+1;
l1=strlen(s1+1);
l2=strlen(s2+1);
s1[l1+1]='#';
strcat(s1+1,s2+1);
zf(s1);
for(i = 1;i <= l1 + l2 + 1; i++){
if(z[i]==l1){
sol++;
if(sol<=1000)
v[sol]=i-l1-2;
}
}
g<<sol<<'\n';
sol=min(sol,1000);
for(i = 1; i <= sol; i++)
g<<v[i]<<" ";
return 0;
}