P2292 [HNOI2004] L 语言 （ac 自动机）

#include <bits/stdc++.h>
using namespace  std;
//#define  int long long
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fi first
#define se second
#define pb  push_back
#define inf 1<<62
#define endl "\n"
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define de_bug(x) cerr << #x << "=" << x << endl
#define all(a) a.begin(),a.end()
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--)
const int mod = 1e9 + 7;
const int N = 2e6 + 10;
const int M=1e5+10;
int n, m;

struct acam {
	struct node {
		int fail;
		int son[26] = {};
	} trie[M];
	int idx = 0;
	int cnt[N];
	int ma = -1;
	void insert(string &s) {
		int u = 0;
		for(auto c : s) {
			if(!trie[u].son[c - 'a']) {
				trie[u].son[c - 'a'] = ++idx;
			}
			u = trie[u].son[c - 'a'];
		}
		cnt[u] = (int)s.size();
		ma = max(ma, (int)s.size());
	}
	void build() {
		queue<int>q;
		for(int i = 0; i <= 25; i++) {
			if(trie[0].son[i]) {
				q.push(trie[0].son[i]);
			}
		}
		while(!q.empty()) {
			int u = q.front();
			q.pop();
			for(int i = 0; i <= 25; i++) {
				int v = trie[u].son[i], fa = trie[trie[u].fail].son[i];
				if(trie[u].son[i]) {
					trie[v].fail = fa;
					q.push(v);
				} else {
					trie[u].son[i] = trie[trie[u].fail].son[i];
				}
			}
		}
	}
	int dp[N];
	int ans;
	int solve(string &s) {
		int len = s.size();
		fer(i, 1, len)dp[i] = 0;
		s = " " + s;
		dp[0] = 1;
		ans = 0;
		int u = 0;
		for(int i = 1; i <= len; i++) {
			if(ans + ma < i)break;
			u = trie[u].son[s[i] - 'a'];
			for(int k = u; k; k = trie[k].fail) {
				dp[i] |= dp[i - cnt[k]];
				if(dp[i])break;
			}
			if(dp[i])ans = i;
		}
		return ans;
	}

} AC;

string s;
void solve() {
	cin >> n >> m;
	for(int i = 1; i <= n; i++) {
		string t;
		cin >> t;
		AC.insert(t);
	}
	AC.build();
	//cout<<AC.ma<<endl;
	fer(i, 1, m) {
		string t;
		cin >> t;
		cout << AC.solve(t) << endl ;
	}

}

int main() {
	IOS;
	int _ = 1;
	//cin>>_;
	while( _-- )
		solve();
}