ソースコード
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"
#include "string"
#include "map"
#include "unordered_map"
#include "iomanip"
#include "random"
using namespace std;
const long long int MOD = 1000000007;
long long int power(long long int x, long long int n, long long int M) {
long long int tmp = 1;
if (n > 0) {
tmp = power(x, n / 2, M);
if (n % 2 == 0) tmp = (tmp*tmp) % M;
else tmp = (((tmp*tmp) % M)*x) % M;
}
return tmp;
}
long long int N, M, K, Q, W, H, L, R;
long long int ans;
long long int dp[3001][3001] = {};
int v[3001] = {};
int rr[3001] = {};
int vsum[3001] = {};
int sum[3001][3001] = {};
long long int Search(int l,int r) {
if (dp[l][r] != INT_MAX)return dp[l][r];
for (int i = l; i <= r; i++) {
if (sum[l][i-1] >= sum[i+1][r]) {
dp[l][r] = min(dp[l][r], Search(l, i - 1)+rr[i]);
}
else {
dp[l][r] = min(dp[l][r], Search(i + 1, r)+rr[i]);
}
}
return dp[l][r];
}
int main() {
ios::sync_with_stdio(false);
cin >> N;
for (int i = 1; i <= N; i++)cin >> v[i];
for (int i = 1; i <= N; i++)cin >> rr[i];
for (int i = 1; i <= N; i++)vsum[i] = vsum[i - 1] + v[i];
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
dp[i][j] = INT_MAX;
}
dp[i][i] = rr[i];
if (i != N)dp[i][i + 1] = rr[i] + rr[i + 1];
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
sum[i][j] = vsum[j] - vsum[i - 1];
}
}
Search(1, N);
cout << dp[1][N] << endl;
return 0;
}