[BZOJ2806][Ctsc2012]Cheat && 后缀自动机

先把所有作文库连起来建立一个后缀自动机 对于每一个询问 把字符串拿到后缀自动机上去跑 计算出每一个位置能匹配的最大长度

然后二分一个L值 用dp来检验

设f[i]为前i个字符的最大匹配数 就有f[i] = max(f[j]+i-j | i-val[i] <= j <= i-L)

显然i-L单调增 所以可以维护一个队列 里面存放i-L~i的元素 然后检验队首元素是否满足i-val[i] <= q.front() 假设当前元素不满足 当i变为i+1时 val[i]至多增长1 所以仍不满足条件 以后也都不会满足 所以可以把它弹出队列

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<queue>
#define SF scanf
#define PF printf
using namespace std;
typedef long long LL;
inline int read() {
	int x = 0, f = 1; char ch = getchar();
	while(ch < '0' || ch > '9') { if(ch == '-') f = -1; ch = getchar(); }
	while(ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
	return x*f;
}
const int MAXN = 2300000;
int fa[MAXN+10], ch[MAXN+10][3], step[MAXN+10];
int last, ncnt, n, m;
struct SAM {
	SAM () { last = ++ncnt; }
	void extend(int c) {
		int p = last, np = last = ++ncnt;
		step[np] = step[p]+1;
		while(!ch[p][c] && p) 
			ch[p][c] = np, p = fa[p];
		if(!p) fa[np] = 1;
		else {
			int q = ch[p][c], nq;
			if(step[q] == step[p]+1) fa[np] = q;
			else {
				nq = ++ncnt;
				step[nq] = step[p]+1;
				memcpy(ch[nq], ch[q], sizeof(ch[q]));
				fa[nq] = fa[q]; fa[q] = fa[np] = nq;
				while(ch[p][c] == q && p) ch[p][c] = nq, p = fa[p];
			}
		}
	}
	void ins(char *s) {
		for(char *c = s; *c; c++) extend(*c-'0');
		extend(2);
	}
} sam;
char s[MAXN+10];
int val[MAXN+10], dp[MAXN+10];
int match() {
	int len = strlen(s+1), u = 1, cur = 0;
	for(int i = 1; i <= len; i++) {
		int c = s[i]-'0';
		if(ch[u][c]) cur++, u = ch[u][c];
		else {
			while(!ch[u][c] && u) u = fa[u];
			if(!u) cur = 0, u = 1;
			else cur = step[u]+1, u = ch[u][c];
		}
		val[i] = cur;
	}
	return len;
}
bool check(int L, int len) {
	dp[0] = 0;
	queue <int> q;
	for(int i = 1; i <= len; i++) {
		dp[i] = dp[i-1];
		int p = i-L;
		if(p >= 0) {
			while(!q.empty() && dp[p]-p > dp[q.front()] - q.front())
				q.pop();
			q.push(p);
		}
		while(!q.empty() && i-val[i] > q.front()) q.pop();
		if(!q.empty()) dp[i] = max(dp[i], dp[q.front()]+i-q.front());
	}
	return 10*dp[len] >= 9*len;
}
int main() {
	n = read(); m = read();
	while(m--) {
		SF("%s", s);
		sam.ins(s);
	}
	for(int i = 1; i <= n; i++) {
		SF("%s", s+1);
		int len = match();
		int l = 0, r = len, ans = 0;
		while(l <= r) {
			int mid = (l+r) >> 1;
			if(check(mid, len)) l = mid+1, ans = mid;
			else r = mid-1;
		}
		PF("%d\n", ans);	
	}
}