寒假第七周 2.22 --- 2.28

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<map>
using namespace std;

typedef long long LL;
const int maxn = 1e5+5;
int dp[maxn],pre[maxn],n,m;
char s[maxn];
char str[maxn][1005];
int mod[2] = {998244353,1000000007};
int base[2] = {217,31};
LL now[2];
LL hehe[1005];

map<pair<LL,LL>,int> h;

void print(int x){
if(pre[x] == -1) return;
int len = strlen(str[pre[x]]);
print(x - len);
printf("%s ",str[pre[x]]);
}

int main(){
while(scanf("%d",&n) != EOF){
scanf("%s",s);
scanf("%d",&m);
h.clear();
for(int i =0;i < m;i++){
scanf("%s",str[i]);
memset(now,0,sizeof(now));
int len = strlen(str[i]);
for(int k = 0;k < 2;k++){
for(int j = 0;j < len;j++){
char c = str[i][j];
if(c >= 'A' && c <= 'Z') c += 'a'-'A';
now[k] = (now[k]*base[k]+c)%mod[k];
}
}
h[make_pair(now[0],now[1])] = i;
}
memset(dp,0,sizeof(dp));
memset(pre,-1,sizeof(pre));
dp[0] = 1;
for(int i = 0;i < n;i++){
memset(now,0,sizeof(now));
for(int j = i;j >= max(0,i-1000);j--){
for(int k = 0;k < 2;k++)
now[k] = (now[k]*base[k]+s[j])%mod[k];
if(dp[j] && h.find(make_pair(now[0],now[1])) != h.end()){
//   printf("i = %d j = %d\n",i,j);
dp[i+1] = 1;
pre[i+1] = h[make_pair(now[0],now[1])];
}
}
}
print(n);
printf("\n");
}
return 0;
}