区间DP学习笔记

区间DP

区间DP学习笔记

时间：2023-9-24

记录人：fengqiao17

---

P1063 [NOIP2006 提高组] 能量项链

状态： $d{p}_{i,j}$ 表示将区间 $i$ 到 $j$ 之间的珠子合并得到的最大能量

答案：$\max (d{p}_{i,i+n-1})$

状态转移：
$$d{p}_{i,j}\leftarrow \max (d{p}_{i,k},d{p}_{i,k}+d{p}_{k+1,j}+hea{d}_i\times hea{d}_{k+1}\times tai{l}_j)$$

答案：$\max (d{p}_{i,i+n-1})$

#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int head[N], tail[N];
int dp[N][N];
int main() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> head[i];
        if (i > 1) {
            tail[i - 1] = head[i];//头尾的标号相同
        }
    }
    tail[n] = head[1];//容易漏掉，记得加上这一行
    for (int i = 1; i <= n; i++) {
        head[i + n] = head[i];
        tail[i + n] = tail[i];
    }
    for (int len = 2; len <= n; len++) {
        for (int i = 1; i + len - 1 <= n * 2 - 1; i++) {
            int j = i + len - 1;
            for (int k = i; k < j; k++) {
                dp[i][j] = max(dp[i][j], dp[i][k] + dp[k + 1][j] + head[i] * head[k + 1] * tail[j]);//区间dp经典思路
            }
        }
    }
    int maxi = 0;
    for (int i = 1; i <= n; i++) {
        maxi = max(maxi, dp[i][i + n - 1]);//记得答案要取max
    }
    cout << maxi;
    return 0;
}

P2890 [USACO07OPEN] Cheapest Palindrome G

状态：$d{p}_{i,j}$ 表示将 $i$ 到 $j$ 的区间变为一个回文串的最小代价。

答案：$d{p}_{1,m}$

状态转移：
$$d{p}_{i,j}=\min (d{p}_{i,j-1}+w_{s_j},d{p}_{i+1,j}+w_{s_i})$$

需要注意的是，当$s_i$ 与 $s_j$ 相等时，还需要转移:
$$d{p}_{i,j}=\min (d{p}_{i,j},d{p}_{i+1,j-1})$$

#include <bits/stdc++.h>
using namespace std;
const int N = 5e3 + 5;
int w[N];
int dp[N][N];
int main() {
    memset(dp, 0x3f, sizeof(dp));
    int n, m;
    string s;
    cin >> n >> m >> s;
    s = '*' + s;
    for (int i = 1; i <= n; i++) {
        char c;
        int a, b;
        cin >> c >> a >> b;
        w[c] = min(a, b);
    }
    for (int i = 1; i <= m; i++) {
        dp[i][i] = 0;
    }
    for (int len = 2; len <= m; len++) {
        for (int i = 1; i + len - 1 <= m; i++) {
            int j = i + len - 1;
            if (s[i] == s[j]) {
                if (len == 2) {
                    dp[i][j] = 0;
                } else {
                    dp[i][j] = dp[i + 1][j - 1];
                }
            }
            dp[i][j] = min(dp[i][j], min(dp[i][j - 1] + w[s[j]], dp[i + 1][j] + w[s[i]]));
        }
    }
    cout << dp[1][m];
    return 0;
}