[BZOJ2806] [Ctsc2012] Cheat(접미사 자동기+단조로운 대기열 최적화 dp)

코드:

#include 
#include 
#include 
using namespace std;
const int N=2200005;
int np,p,nq,q,last,cnt,ch[N][2],fa[N],step[N],l[N],len,f[N],que[N];
char st[N];
void insert(int c)
{
    p=last; np=last=++cnt;
    step[np]=step[p]+1;
    while (p && !ch[p][c]) ch[p][c]=np,p=fa[p];
    if (!p) {fa[np]=1;return;}
    q=ch[p][c];
    if (step[q]==step[p]+1){fa[np]=q;return;}
    nq=++cnt; 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) ch[p][c]=nq,p=fa[p];
}
void init()
{
    p=1;int tmp=0;
    for (int i=1;i<=len;i++)
    {
        int c=st[i]-'0';
        if (ch[p][c]) p=ch[p][c],tmp++;
        else
        {
            while (p && !ch[p][c]) p=fa[p];
            if (!p) p=1,tmp=0;
            else tmp=step[p]+1,p=ch[p][c];
        }
        l[i]=tmp;
    }
}
bool check(int L)
{
    if (L==0) return 1;
    f[0]=0;
    int head=1,tail=0;
    for (int i=1;i<=len;i++)
    {
        f[i]=f[i-1];
        if (icontinue;      
        while (head<=tail && f[que[tail]]-que[tail]-L<=f[i-L]-i) tail--;
        que[++tail]=i-L;
        while (head<=tail && que[head]if (head<=tail) f[i]=max(f[i],f[que[head]]+i-que[head]);
    }
    return f[len]*10>=len*9;
}
void solve()
{
    init();
    int l=0,r=len,ans;
    while (l<=r)
    {
        int mid=(l+r)>>1;
        if (check(mid)) l=mid+1,ans=mid;
        else r=mid-1;
    }
    printf("%d
",ans);
}
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    cnt=1;
    for (int i=1;i<=m;i++)
    {
        scanf("%s",st+1);
        int l=strlen(st+1);last=1;
        for (int j=1;j<=l;j++) insert(st[j]-'0');
    }
    for (int i=1;i<=n;i++)
    {
        scanf("%s",st+1);
        len=strlen(st+1);
        solve();
    }
}