动态规划-区间DP

石子合并（一排）

//区间动规-石子合并（一排）
#include<bits/stdc++.h>
using namespace std;
int n;
int a[510], s[510];
int dp[510][510];

int main(){
    cin >> n;
    for (int i = 1; i <= n; i++){
        cin >> a[i];
        s[i] = s[i - 1] + a[i];
    }
    memset(dp, 127, sizeof(dp));
    for (int i = 0; i <= n; i++){
        dp[i][i] = 0;
    }
    for (int i = 1; i < n; i++){ // i表示区间长度
        for (int j = 1; j <= n - i; j++){ // j表示区间起始位置
            for (int k = j; k < j + i; k++){
                dp[j][j + i] = min(dp[j][j + i], dp[j][k] + dp[k + 1][j + i] + s[j + i] - s[j - 1]);
            }
        }
    }
    printf("%d\n", dp[1][n]);
    return 0;
} 

石子合并（一圈）

//区间DP-石子合并2（一圈）
#include<bits/stdc++.h>
using namespace std;
int n;
int a[1010], s[1010];
int dp[1010][1010];

int main(){
    cin >> n;
    for (int i = 1; i <= n; i++){
        cin >> a[i];
        a[n + i] = a[i];
    }
    for (int i = 1; i <= 2 * n; i++){
        s[i] = s[i - 1] + a[i];
    }
    memset(dp, 127, sizeof(dp));
    for (int i = 1; i <= 2 * n; i++){
        dp[i][i] = 0;
    }
    for (int i = 1; i < 2 * n; i++){
        for (int j = 1; j <= 2 * n - i; j++){
            for (int k = j; k < j + i; k++){
                dp[j][j + i] = min(dp[j][j + i], dp[j][k] + dp[k + 1][j + i] + s[j + i] - s[j - 1]);
            }
        }
    }
    int ans = 0x3fffffff;
    for (int i = 1; i <= n; i++){
        ans = min(ans, dp[i][i + n - 1]);
    }
    printf("%d\n", ans);
    return 0; 
} 

括号序列

//区间DP-括号序列
#include<bits/stdc++.h>
using namespace std;
int n;
int dp[510][510];
char a[510];

int main(){
    scanf("%d%s", &n, a + 1);
    for (int i = 1; i < n; i++){
        for (int j = 1; j <= n - i; j++){
            if ((a[j + i] == ')' && a[j] == '(') || a[j] == '[' && a[j + i] == ']'){
                dp[j][j + i] = max(dp[j][j + i], dp[j + 1][j + i - 1] + 2);
            }
            for (int k = j; k < j + i; k++){
                dp[j][j + i] = max(dp[j][j + i], dp[j][k] + dp[k + 1][j + i]);
            }
        }
    }
    printf("%d\n", dp[1][n]);
    return 0;
}