AcWing 320. 能量项链 环形区间DP
原题链接
中等
作者:
Snrise
,
2024-04-04 20:21:23
,
所有人可见
,
阅读 1
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define endl '\n'
#define int long long
using namespace std;
const int N = 210;
int f[N][N];
int w[N];
int n;
signed main(void)
{
std::ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> w[i];
w[i + n] = w[i];
}
for (int len = 3; len <= n + 1; len++)
{
for (int i = 1; i + len - 1 <= 2 * n; i++)
{
int j = i + len - 1;
for (int k = i + 1; k + 1 <= j; k++)
{
f[i][j] = max(f[i][j], f[i][k] + f[k][j] + w[i] * w[k] * w[j]);
}
}
}
int ans = 0;
for (int i = 1; i + n <= 2 * n; i++)
{
int j = i + n;
ans = max(ans, f[i][j]);
}
cout << ans << endl;
return 0;
}