Pagini recente » Cod sursa (job #2064405) | Cod sursa (job #2295595) | Cod sursa (job #945977) | Istoria paginii runda/20_februarie_simulare_oji_2024_clasele_11_12/clasament | Cod sursa (job #2193624)
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
#define MAX 2000050
int n,m,SOL[MAX];
char s[MAX], pat[MAX];
void read(){
fin>>pat;
fin>>s;
n=strlen(s);
m=strlen(pat);
}
void findLPS(char *pat,int m, int *lps){
int l=0;
int i=1;
lps[0]=0;
while(i<m){
if(pat[i]==pat[l]){
l++;
lps[i]=l;
i++;
}
else if(pat[i]!=pat[l]){
if(l!=0)
l=lps[l-1];
else if(l==0){
i++;
lps[i]=l;
}
}
}
}
void KMP(char *pat, char *s,int m, int n){
int *lps;
lps=(int*)malloc(m*sizeof(int));
findLPS(pat,m,lps);
int i=0;
int j=0;
int k=0;
while(i<n){
if(pat[j]==s[i]){
j++;
i++;
}
else
if(j!=0)
j=lps[j-1];
else
i++;
if(j==m){
j=lps[j-1];
SOL[++k]=i-j;
}
}
fout<<k<<'\n';
for(i=0;i<k;i++)
fout<<SOL[i]<<" ";
}
int main()
{
read();
KMP(pat,s,m,n);
}