算法竞赛进阶指南——0x53【区间DP】

🐂🐂

以区间长度作为dp的阶段
牛客一道小例题石子合并
状态转移方程dp[l,r]=min(dp[l,k]+dp[k+1][r]+(Σa[l] ~ a[r]))

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 305;
const int inf = 0x3f3f3f3f;
ll n;
ll a[N], suma[N], dp[N][N];
int main()
{
    scanf("%lld", &n);
    for (int i = 1; i <= n; i++)
    {
        scanf("%lld", &a[i]);
        suma[i] = suma[i - 1] + a[i];//前缀和
    }
    memset(dp, inf, sizeof(dp));//初始化
    for (int i = 1; i <= n; i++)
        dp[i][i] = 0;
    for (int len = 2; len <= n; len++)//阶段
        for (int l = 1; l <= n - len + 1; l++)//左状态
        {
            int r = len - 1 + l;//右状态
            for (int k = l; k < r; k++)//决策
                dp[l][r] = min(dp[l][r], dp[l][k] + dp[k + 1][r] + (suma[r] - suma[l - 1]));//状态转移方程
        }
    printf("%lld\n", dp[1][n]);//目标
    return 0;
}

牛客一道小栗子金字塔
思路

类似dfs序，如果得到s[l] = s[r]，说明[l,r]之间的数都属于同一子树。
同一子树的结果满足加法原理，不同子树的结果满足乘法原理。记忆化搜索就可以了
状态转移方程 dp[l,r]+=dp[l+1,k-1]*dp[k,r]

#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize(3, "Ofast", "inline")
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
const int N = 305;
const int inf = 0x3f3f3f3f;
const int mod = 1e9;
#define IOS                  \
    ios::sync_with_stdio(0); \
    cin.tie(0);              \
    cout.tie(0);
char s[N];
ll dp[N][N];
ll dfs(ll l, ll r)
{
    if (l > r)
        return 0;
    if (l == r)
        return 1; //即dp[l][l]=dp[r][r]=1
    if (s[l] != s[r])
        return 0;
    if (dp[l][r] != -1)
        return dp[l][r]; //记忆化
    dp[l][r] = 0;        //
    for (ll k = l + 2; k <= r; k++)
        dp[l][r] = (dp[l][r] + dfs(l + 1, k - 1) * dfs(k, r)) % mod; //递归
    return dp[l][r];
}
int main()
{
    // IOS;
    scanf("%s", s + 1);
    ll n = strlen(s + 1);
    memset(dp, -1, sizeof(dp)); //
    cout << dfs(1, n) << endl;
    return 0;
}