-
Notifications
You must be signed in to change notification settings - Fork 6
/
CPATTERN.cpp
109 lines (95 loc) · 2.1 KB
/
CPATTERN.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<vector>
#include<queue>
#include<algorithm>
#include<set>
#include<cstdio>
using namespace std;
#define pb push_back
#define mp make_pair
int n,q,s,count=0;
int pattern[25001],text[100001];
int F[100001];
int pos[30];
bool visited[25001];
int v[3][25001];
vector <int> ans;
int lo,mid,hi;
void failure_func()
{
int i,j;
F[0]=0;
j=0;
i=1;
pos[pattern[0]]=0;
while(i<q)
{
for(int k=0;k<pattern[i];k++)
if(pos[k]!=-1)
v[0][i]=i-pos[k];
for(int k=26;k>pattern[i];k--)
if(pos[k]!=-1)
v[2][i]=i-pos[k];
if(pos[pattern[i]]!=-1)
v[1][i]=i-pos[pattern[i]];
pos[pattern[i]]=i;
lo=v[0][j];
mid=v[1][j];
hi=v[2][j];
if( (mid==-1 || pattern[i-mid]==pattern[i]) && (lo==-1 || pattern[i-lo]<pattern[i]) && (hi==-1 || pattern[i-hi]>pattern[i]) )
{
F[i]=j+1;
i++;
j++;
}
else if(j>1)
j=F[j-1];
else
F[i++]=1;
}
}
void KMP()
{
failure_func();
int i=0,j=0;
while(i<n)
{
lo=v[0][j];
mid=v[1][j];
hi=v[2][j];
if( (mid==-1 || text[i-mid]==text[i]) && (lo==-1 || text[i-lo]<text[i]) && (hi==-1 || text[i-hi]>text[i]) )
{
if(j==q-1)
{
ans.pb(i-q+2);
j=F[j];
i++;
}
else
{
i++;
j++;
}
}
else if(j>1)
j=F[j-1];
else
i++;
}
}
int main()
{
scanf("%d%d%d",&n,&q,&s);
for(int i=0;i<n;i++)
scanf("%d",&text[i]);
for(int i=0;i<q;i++)
scanf("%d",&pattern[i]);
memset(pos,-1,sizeof(pos));
memset(v,-1,sizeof(v));
KMP();
printf("%d\n",ans.size());
for(int i=0;i<ans.size();i++)
printf("%d\n",ans[i]);
}