牛客字符串SAM专题-D-Typewriter(后缀自动机优化dp)

题目链接

D-Typewriter_牛客竞赛字符串专题班SAM（后缀自动机简单应用）习题 (nowcoder.com)https://ac.nowcoder.com/acm/contest/37092/D

题目描述

One day, Jerry found a strange typewriter. This typewriter has 2 input modes: pay ppp coins to append an arbitrary single letter to the back, or qqq coins to copy a substring that has already been outputted and paste it in the back.
Jerry now wants to write a letter to Tom. The letter is a string SSS which contains only lowercase Latin letters. But as Jerry is not very wealthy, he wants to know the minimum number of coins he needs to write this letter.

输入描述

The first line contains string S(1≤∣S∣≤2×105)S (1\le |S| \le 2\times 10^5)S(1≤∣S∣≤2×105) which contains only lowercase Latin letters.

The second line contains 2 integers ppp and q(1≤p,q≤230)q (1 \le p ,q\le 2^{30})q(1≤p,q≤230)

样例数据

示例1

输入

abc

1 2

输出

3

示例2

输入

aabaab

2 1

输出

6

题意理解

给定一个字符串和两个数字p、q。两种操作，打印一个字符花费为p / 打印一个已经打印出来的串的子串花费为q，输出打印给出字符串的最小花费

思路

需要dp来处理这道题目
SAM是一个在线算法，可以很好地和DP结合起来
两个指针 L 和 R，L表示当前已经放入后缀自动机的串的长度；R表示当前已经打印的串的长度。dp[R]=min(dp[L]+q,dp[R-1]+p); 需要注意的是每次后缀自动机状态转移了之后要跳fail树 找最小的满足要求的节点（详见下面的代码）

AC_Code 

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

namespace SAM {   //SAM模板
    const int N_CHAR = 26;
    const int MAXN = 2e5 + 100;
    struct Node {
        int nxt[N_CHAR], fail;
        int len; 
        int pos; 
        int cnt; 
    }node[MAXN * 2];
    int now, numn, last, root;
    inline int newNode(int l, int p) {
        int x = ++numn;
        for (int i = 0; i < N_CHAR; i++) node[x].nxt[i] = 0;
        node[x].cnt = node[x].fail = 0;
        node[x].len = l;
        node[x].pos = p;
        return x;
    }
    inline void init(){
        root = last = newNode(numn = 0, 0);
    }
    inline void addChar(int c) {
        int p = last, np = newNode(node[p].len + 1, node[p].len + 1);
        while (p && node[p].nxt[c] == 0) node[p].nxt[c] = np, p = node[p].fail;
        if (p == 0) node[np].fail = root; else {
            int q = node[p].nxt[c];
            if (node[p].len + 1 == node[q].len) {
                node[np].fail = q;
            }
            else {
                int nq = newNode(node[p].len + 1, node[q].pos);
                for (int i = 0; i < N_CHAR; i++) node[nq].nxt[i] = node[q].nxt[i];
                node[nq].fail = node[q].fail;
                node[q].fail = node[np].fail = nq;
                while (p && node[p].nxt[c] == q) node[p].nxt[c] = nq, p = node[p].fail;
            }
        }
        last = np;  node[np].cnt = 1;
    }
}

using namespace SAM;
char s[MAXN];
ll dp[MAXN];

void rew(int d)//d为当前的打印的子串的长度，如果当前节点fail节点的长度大于等于d，那它比当前节点更优
{
    while (node[node[now].fail].len >= d && now) now = node[now].fail;
    if (now == 0)now = 1;
}

int main()
{
    while (~scanf("%s", s + 1))
    {
        ll p, q;
        scanf("%lld%lld", &p, &q);
        init();
        int len = strlen(s + 1);
        memset(dp, 0, sizeof(ll)*(len + 20));
        dp[1] = p;
        int l, r;
        l = 1;
        r = 1;
        now = root;
        addChar(s[1] - 'a');
        for (int i = 2; i <= len; i++)
        {
            r++;
            int c = s[i] - 'a';
            dp[r] = dp[r - 1] + p;
            while (node[now].nxt[c] == 0 || (r - l) > l&&l < r)
            {
                l++;
                addChar(s[l] - 'a');
                rew(r - l-1);
            }
            now = node[now].nxt[c];
            rew(r - l);
            if(l<=r)
               dp[r] = min(dp[r - 1] + p, dp[l] + q);
        }
        printf("%lld\n", dp[len]);
    }
    return 0;
}