Pagini recente » Cod sursa (job #1288650) | Cod sursa (job #2225542) | Cod sursa (job #3281641) | Cod sursa (job #1749325) | Cod sursa (job #2020825)
#include <fstream>
#include <cstdio>
#include <string.h>
using namespace std;
ifstream fin ("strmatch.in");
ofstream fout ("strmatch.out");
char s[4000005];
long long counter, raspuns[1001];
int z[4000005];
void z_algorithm (int n, int lungime)
{
int l, r;
l = r = 1;
for ( int i = 2; i<=n; ++i )
{
if ( i > r )
{
while ( z[i] + i <=n && s[z[i]+i] == s[z[i]+1])
z[i]++;
l = i;
r = i + z[i] - 1;
}
else
{
if ( i+ z[i-l+1] - 1 < r)
z[i] = z[i-l+1];
else
{
z[i] = r - i;
while ( z[i] + i <= n && s[z[i]+i] == s[z[i]+1])
z[i]++;
l = i;
r = i + z[i] - 1;
}
}
if ( z[i] == lungime)
{
++counter;
if ( counter <= 1000)
raspuns[counter] = i - lungime - 2;
}
}
}
int main()
{
int n, i, len;
fin>>(s+1);
len = strlen (s+1);
s[len+1] = '#';
fin>>(s+len+2);
n = strlen (s+1);
z_algorithm(n, len);
fout<<counter<<'\n';
for ( int i = 1; i <= counter && i <= 1000; ++i )
fout<<raspuns[i]<<" ";
}