区间dp求dalao帮忙看看

#include<bits/stdc++.h>
using namespace std;
int n,dp[105][105],nb[105][105], a[105],s[105];
int main() {
    cin >> n;
    for (int i = 1; i <= n; i++)cin >> a[i];
    for (int i = 1; i <= n; i++)s[i] = s[i - 1] + a[i];
    for (int i = 2; i <= n; i++) {
        for (int j = 1; j + i - 1 <= n; j++) {
            dp[j][j + i - 1] = -1e9;
            nb[j][j + i - 1] = 1e9;
            for (int k = j; k < i+j-1; k++) {
                dp[j][j + i - 1] = max(dp[j][j + i - 1], dp[j][k] + dp[k + 1][j + i - 1] + s[j + i - 1] - s[j - 1]);
                nb[j][j + i - 1] = min(nb[j][j + i - 1], nb[j][k] + nb[k + 1][j + i - 1] + s[j + i - 1] - s[j - 1]);
            }
        }
    }cout << nb[1][n] << endl << dp[1][n];
    return 0;
}