Pagini recente » Cod sursa (job #2149366) | Istoria paginii runda/oji201811/clasament | Cod sursa (job #2846585) | Cod sursa (job #2105566) | Cod sursa (job #3150658)
#include <fstream>
#include <vector>
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
char s[2000001], pattern[2000001];
int aux[2000001];
void buildaux()
{
int i=1, j=0;
aux[0]=0;
while(pattern[i]!=0)
{
if(pattern[i]==pattern[j])
{
aux[i]=j+1;
j++;
i++;
}
else
{
if(j==0)
{
aux[i]=0;
i++;
}
else
j=aux[j-1];
}
}
}
int main() {
in.getline(pattern, 2000000);
in.getline(s, 2000000);
buildaux();
int i=0, j=0;
vector<int> sols;
while(s[i]!=0)
{
if(s[i]==pattern[j])
{
i++;
j++;
if(pattern[j]==0)
{
sols.push_back(i-j);
j=aux[j-1];
}
}
else
{
if(j==0)
i++;
else
j=aux[j-1];
}
}
out<<sols.size()<<'\n';
for(int i=0;i<min(1000ull, sols.size());i++)
out<<sols[i]<<" ";
return 0;
}