思路
区间DP模板题,就是题意有点麻烦。
dp[i][j]表示从 i 到 j 的最大值。
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 205;
typedef long long LL;
int n, a[MAXN], dp[MAXN][MAXN];
int main()
{
while (~scanf("%d", &n))
{
for (int i = 1; i <= n; i++)
{
scanf("%d", &a[i]);
a[i + n] = a[i];
}
memset(dp, 0, sizeof(dp));
for (int len = 1; len <= n; len++)
{
for (int i = 1; i + len - 1 <= 2 * n; 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] + a[i] * a[k + 1] * a[j + 1]);
}
}
}
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, dp[i][i + n - 1]);
printf("%d\n", ans);
}
return 0;
}
/*
4
2 3 5 10
*/