Pagini recente » Cod sursa (job #1975931) | Cod sursa (job #1155056) | Cod sursa (job #668832) | Cod sursa (job #1290470) | Cod sursa (job #3150685)
#include <bits/stdc++.h>
#define vmax 2000005
using namespace std;
char a[vmax], b[vmax];
int n, m, st, dr, z[2 * vmax + 5], u, nr, v[1001];
char t[2 * vmax + 5];
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int32_t main()
{
ios_base::sync_with_stdio(0);
fin.tie(0);
fout.tie(0);
fin >> b;
fin >> a;
n = strlen(a), m = strlen(b);
for(int i = 0; i < m; ++i)
{
t[i] = b[i];
}
t[m] = '#';
for(int i = 0; i < n; ++i)
{
t[i + m + 1] = a[i];
}
n = n + m + 1;
st = dr = z[0] = 0;
for(int k = 1; k < n; ++k)
{
if(k > dr)
{
st = dr = k;
while(dr < n && t[dr] == t[dr - st])
{
dr++;
}
z[k] = dr - st;
dr--;
}
else
{
u = k - st;
if(k + z[u] <= dr)
{
z[k] = z[u];
}
else
{
st = k;
while(dr < n && t[dr] == t[dr - st])
{
dr++;
}
z[k] = dr - st;
dr--;
}
}
if(z[k] == m)
{
if(nr <= 1000)
{
v[++nr] = k - m - 1;
}
}
}
fout << nr << '\n';
for(int i = 1; i <= nr; ++i)
{
fout << v[i] << " ";
}
return 0;
}